04621nam a22006375i 4500
978-3-540-69193-8
DE-He213
20170515111448.0
cr nn 008mamaa
121227s1997 gw | s |||| 0|eng d
9783540691938
978-3-540-69193-8
10.1007/3-540-63163-1
doi
QA75.5-76.95
UY
bicssc
UYA
bicssc
COM014000
bisacsh
COM031000
bisacsh
004.0151
23
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
[electronic resource] :
12th International Symposium, AAECC-12 Toulouse, France, June 23–27, 1997 Proceedings /
edited by Teo Mora, Harold Mattson.
Berlin, Heidelberg :
Springer Berlin Heidelberg,
1997.
X, 362 p.
online resource.
text
txt
rdacontent
computer
c
rdamedia
online resource
cr
rdacarrier
text file
PDF
rda
Lecture Notes in Computer Science,
0302-9743 ;
1255
Minimun distance decoding algorithms for linear codes -- Efficient multivariate factorization over finite fields -- On maximal codes in polynomial metric spaces -- Yet another ideal decomposition algorithm -- A resultant theory for ordinary algebraic differential equations -- The symmetry group of ? q n in the Lee space and the ? q n-linear codes -- On repeated-root cyclic codes and the two-way chain condition -- Exponentiation in finite fields: Theory and practice -- Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane -- Certain self-dual codes over ?4 and the odd Leech lattice -- Order functions and evaluation codes -- Codes from cocycles -- A brief tour of split linear programming -- Elementary approximation of exponentials of Lie polynomials -- On the q-ary image of cyclic codes -- The split weight (w L , w R ) enumeration of Reed-Muller codes for w L +w R d min -- Optimal linear codes of dimension 4 over GF(5) -- Characterisations of lexicographic sets and simply-connected Hilbert schemes -- An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance -- Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach -- Formal duality of linearly presentable codes over a Galois field -- Trace-function on a Galois ring in coding theory -- A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes -- On generalized Hamming weights of codes constructed on affine algebraic sets -- Some results on regular mappings -- Extension theorems for linear codes over finite rings -- Nonperiodic cyclic equivalence classes of cyclic codes and algebraic constructions of cyclically permutable codes.
This book constitutes the strictly refereed proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-12, held in Toulouse, France, June 1997. The 27 revised full papers presented were carefully selected by the program committee for inclusion in the volume. The papers address a broad range of current issues in coding theory and computer algebra spanning polynomials, factorization, commutative algebra, real geometry, group theory, etc. on the mathematical side as well as software systems, telecommunication, complexity theory, compression, signal processing, etc. on the computer science and engineering side.
Computer science.
Coding theory.
Computers.
Numerical analysis.
Computer science
Mathematics.
Algebra.
Applied mathematics.
Engineering mathematics.
Computer Science.
Theory of Computation.
Algebra.
Applications of Mathematics.
Coding and Information Theory.
Symbolic and Algebraic Manipulation.
Numeric Computing.
Mora, Teo.
editor.
Mattson, Harold.
editor.
SpringerLink (Online service)
Springer eBooks
Printed edition:
9783540631637
Lecture Notes in Computer Science,
0302-9743 ;
1255
http://dx.doi.org/10.1007/3-540-63163-1
ZDB-2-SCS
ZDB-2-LNC
ZDB-2-BAE
ddc
EB
Computer Science (Springer-11645)
14327
14327