Abstract
We give a constructive characterization of all self dual 2n circulant codes over F2r. This construction generalizes those of F. J. MacWilliams [3], and G.F.M. Beenker [1]. Our method is original. We also give the number of these codes, as well as an outline of an algorithm to construct them. At last, we give several codes we have obtained by software at AAECC Lab.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G.F. Beenker “On double circulant codes” T.H. Report 80, WSK 04 July 1980
M. Karlin “New binary coding results by circulants” IEEE trans. info. Theory, 15, (1969), 797–802
J.S. Leon,J.M. Masley,V. Pless “On weights in duadic codes” Abstract of papers, IEEE june 24–28, (1985), Brighton, U.K.
F.J. MacWilliams “Orthogonal circulant matrices over finite fields” J. of Comb. Theory, 10, 1971, 1–17
F.J. MacWilliams,N.J.A. Sloane “The theory of error correcting codes” North Holland Mathematic Library, vol. 16, 1977
A. Poli “Codes dans certaines algèbres modulaires” Thèse d'état, Univ. P. Sabatier, Toulouse, FRANCE, 1978
A. Poli “Idéaux principaux nilpotents de dimension maximale dans l'algèbre Fq[G] d'un groupe abélien” Com. in Algebra, vol. 12, no 3 et 4, (1984), 391–401
A. Poli “Construction of primitive idempotents for n variable codes” Acts of AAECC-2 Coll., Toulouse 1984, (submitted for p. Spring. Ver.)
M. Ventou “Contribution à l'étude des codes polynomiaux” Thèse de 3ème cycle, Univ. P. Sabatier, Toulouse, FRANCE, 1984
M. Ventou, C. Rigoni “Self dual doubly circulant codes” Discrete Math., 56 vol. 1,2 (1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poli, A., Rigoni, C. (1986). Self-dual codes 2n circulant over Fq (q=2r). In: Calmet, J. (eds) Algebraic Algorithms and Error-Correcting Codes. AAECC 1985. Lecture Notes in Computer Science, vol 229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16776-5_722
Download citation
DOI: https://doi.org/10.1007/3-540-16776-5_722
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16776-1
Online ISBN: 978-3-540-39855-4
eBook Packages: Springer Book Archive