The proceedings contain 44 papers. The special focus in this conference is on algebraicalgorithms and error-correctingcodes. The topics include: algebraic methods for constructing asymmetric cryptosystems;covering r...
ISBN:
(纸本)9783540167761
The proceedings contain 44 papers. The special focus in this conference is on algebraicalgorithms and error-correctingcodes. The topics include: algebraic methods for constructing asymmetric cryptosystems;covering radii of even subcodes of t-dense codes;orthogonal transform encoding of cyclic codes;on s-sum-sets and projective codes;pseudo-triple-sum-sets and association schemes;a decoding algorithm for linear codes;the finite Fourier-transform and theta functions;recent results on coding and algebraic geometry;some properties of elliptic codes over a field of characteristic 2;on the arithmetics of Galoisfields and the like: algebraic questions arising in the design of secure communication systems;self-dual codes 2n circulant over Fq(q=2r);automorphisms and isometries of some modular algebras;a lower bound for the bilinear complexity of some semisimple lie algebras;on computational complexity of some algebraic curves over finite fields;some group presentations and enforcing the associative law;fast computation of linear finite-dimensional operators over arbitrary rings;quantifier elimination for real closed fields;efficient decision algorithms for locally finite theories;the algorithmic structure of sl(2,k);optimal algorithms for finite dimensional simply generated algebras;on strongly tactical codes;on a little but useful algorithm;computation of independent units in number fields by Dirichlet's method: Extended abstract;some upper bounds for the multiplicity of an autoreduced subset of Nmand their applications;exact computation of the characteristic polynomial of an integer matrix;an analysis of the Krönecker algorithm for factorization of algebraic polynomials;polynomial factorization over [X];the L-machine: An attempt at parallel hardware for symbolic computation.
We give several algebraic techniques, useful for the study of error-correctingcodes: decomposition of ideals, automorphisms. We also prove that codes with coefficients in a noetherian ring are not better than codes w...
详细信息
We introduce t-density for codes to find either the exact value of or an upper bound on the covering radius of even subcodes. We find results on the number of cosets of maximum weight of even subcodes. Exact results a...
详细信息
We present here results obtained by simulation of error-correctingcodes. The software was developed for a Research and Development Program sponsored by CNES (Centre National d39;Etudes Spatiales), on the use of err...
详细信息
A decoding algorithm for linear codes is presented, which is able to correct beyond the half minimum distance and which has the capability to include soft decision decoding. Results on applying this algorithm to some ...
详细信息
暂无评论