000 06519nam a22006615i 4500
001 978-3-540-45624-7
003 DE-He213
005 20240423132453.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540456247
_9978-3-540-45624-7
024 7 _a10.1007/3-540-45624-4
_2doi
050 4 _aQA150-272
072 7 _aPBF
_2bicssc
072 7 _aMAT002000
_2bisacsh
072 7 _aPBF
_2thema
082 0 4 _a512
_223
245 1 0 _aApplied Algebra, Algebraic Algorithms and Error-Correcting Codes
_h[electronic resource] :
_b14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. Proceedings /
_cedited by Serdar Boztas, Igor E. Shparlinski.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aXII, 404 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2227
505 0 _aInvited Contributions -- The Ubiquity of Reed-Muller Codes -- Self-dual Codes-Theme and Variations -- Design of Differential Space-Time Codes Using Group Theory -- Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms -- Block Codes -- Self-dual Codes Using Image Restoration Techniques -- Low Complexity Tail-Biting Trellises of Self-dual codes of Length 24, 32 and 40 over GF(2) and Z4 of Large Minimum Distance -- F q -Linear Cyclic Codes over F q m: DFT Characterization -- Code Constructions -- Cyclic Projective Reed-Muller Codes -- Codes Identifying Sets of Vertices -- Duality and Greedy Weights of Linear Codes and Projective Multisets -- Codes and Algebra:Rings and Fields -- Type II Codes over IF2r -- On Senary Simplex Codes -- Optimal Double Circulant Z4-Codes -- Constructions of Codes from Number Fields -- On Generalized Hamming Weights for Codes over Finite Chain Rings -- Information Rates and Weights of Codes in Structural Matrix Rings -- Codes and Algebra:Algebraic Geometry Codes -- On Hyperbolic Codes -- On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes -- Computing the Genus of a Class of Curves -- Sequences -- Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers -- Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation -- On the Non-existence of (Almost-)Perfect Quaternary Sequences -- Maximal Periods of x2 + c in Fq -- On the Aperiodic Correlation Function of Galois Ring m-Sequences -- Euclidean Modules and Multisequence Synthesis -- Cryptography -- On Homogeneous Bent Functions -- Partially Identifying Codes for Copyright Protection -- On the Generalised Hidden Number Problem and Bit Security of XTR -- CRYPTIM: Graphs as Tools for Symmetric Encryption -- Algorithms -- An Algorithm for Computing Cocyclic Matrices Developed over Some Semidirect Products -- Algorithms for Large Integer Matrix Problems -- On the Identification of Vertices and Edges Using Cycles -- Algorithms:Decoding -- On Algebraic Soft Decision Decoding of Cyclic Binary Codes -- Lifting Decoding Schemes over a Galois Ring -- Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms -- A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding -- An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC -- Algebraic Constructions -- Cartan’s Characters and Stairs of Characteristic Sets -- On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2 -- Algebraic Constructions for PSK Space-Time Coded Modulation.
520 _aThe AAECC Symposia Series was started in 1983 by Alain Poli (Toulouse), who, together with R. Desq, D. Lazard, and P. Camion, organized the ?rst conference. Originally the acronym AAECC meant “Applied Algebra and Error-Correcting Codes”. Over the years its meaning has shifted to “Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes”, re?ecting the growing importance of complexity in both decoding algorithms and computational algebra. AAECC aims to encourage cross-fertilization between algebraic methods and their applications in computing and communications. The algebraic orientation is towards ?nite ?elds, complexity, polynomials, and graphs. The applications orientation is towards both theoretical and practical error-correction coding, and, since AAECC 13 (Hawaii, 1999), towards cryptography. AAECC was the ?rst symposium with papers connecting Gr¨obner bases with E-C codes. The balance between theoretical and practical is intended to shift regularly; at AAECC-14 the focus was on the theoretical side. The main subjects covered were: – Codes: iterative decoding, decoding methods, block codes, code construction. – Codes and algebra: algebraic curves, Gr¨obner bases, and AG codes. – Algebra: rings and ?elds, polynomials. – Codes and combinatorics: graphs and matrices, designs, arithmetic. – Cryptography. – Computational algebra: algebraic algorithms. – Sequences for communications.
650 0 _aAlgebra.
650 0 _aCoding theory.
650 0 _aInformation theory.
650 0 _aComputer science
_xMathematics.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aAlgorithms.
650 0 _aMathematics
_xData processing.
650 1 4 _aAlgebra.
650 2 4 _aCoding and Information Theory.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aCryptology.
650 2 4 _aAlgorithms.
650 2 4 _aComputational Mathematics and Numerical Analysis.
700 1 _aBoztas, Serdar.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aShparlinski, Igor E.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540429111
776 0 8 _iPrinted edition:
_z9783662195369
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2227
856 4 0 _uhttps://doi.org/10.1007/3-540-45624-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188107
_d188107