Abstract
We consider nonbinary codes with growing length and fixed distance. Linear double-error correcting codes over an arbitrary field GF(q) with length n = qm and r ⩽ 2(m + 1) + [m/3] check symbols are constructed. Codes with greater distances are also studied.
Preview
Unable to display preview. Download preview PDF.
References
F.J.MacWilliams and N.J.A.Sloane. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1976.
I.I.Dumer. Nonbinary codes with distances 4,5, and 6 of cardinality greater than the BCH codes, Problemy Peredachi Inform., vol. 24, N 3 (1988), 42–54.
D.N.Gevorkyan, A.M.Avetisyan, and V.A.Tigranyan. On the construction of codes correcting two errors in Hamming metric over Galois fields. In Vychislitel'naya Technika, Kuibyshev, N 3 (1975), 19–21 (in Russian).
I.I.Dumer and V.A.Zinoviev. Some new codes over Galois fields GF(2r), In Proc. 4th Intern. Sympos. Inform. Theory, Pt.2, Moscow-Leningrad (1976), 37–39 (in Russian).
Z.I.Borevich and I.R.Shafarevich. Number Theory. Moscow, Nauka, 1972 (in Russian).
I.I.Dumer. Nonbinary codes with distance 5. In Proc. 2nd Intern. Workshop on Algebraic and Combinatorial Coding Theory, Leningrad, Moscow (1990), 63–66.
D.N.Gevorkyan. On nonbinary codes with fixed code distance. In Proc. 5th Intern. Symp. Inform. Theory, Abstracts of papers, Pt.1, Moscow-Tbilisi (1979), 93–96 (in Russian).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dumer, I.I. (1992). On nonbinary codes with fixed distance. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034342
Download citation
DOI: https://doi.org/10.1007/BFb0034342
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55130-0
Online ISBN: 978-3-540-46739-7
eBook Packages: Springer Book Archive