Abstract
Let V be a list of all vectors of GF(q)n, lexicographically ordered with respect to some basis. Algorithms which search list V from top to bottom, any time selecting a codeword which satisfies some criterion, are called greedy algorithms and the resulting set of codewords is called a lexicode. In many cases such a lexicode turns out to be linear. In this paper we present a greedy algorithm for the construction of a large class of linear q-ary lexicodes which generalizes the algorithms of several other papers and puts these into a wider framework. By applying this new method, one can produce linear lexicodes which cannot be constructed by previous algorithms, because the characteristics or the underlying field of the codes do not meet the conditions of those algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
JT. Bonn (1996) ArticleTitleForcing linearity on greedy codes Designs, Codes and Crypthography. 9 39–49
R.A. Brualdi VS. Pless (1993) ArticleTitleGreedy codes Journal of Combinatorial Theory Series A, 64 10–30
Conway J.H., Sloane N.J.A. (1986). Lexicographic codes: Error-correcting codes from game theory. IEEE Transaction Information Theory, IT-32, No. 3 337–348
JH. Conway (1990) ArticleTitleIntegral lexicographic codes Discrete Mathematics. 83 219–235 Occurrence Handle10.1016/0012-365X(90)90008-6
PG. Farrell (1970) ArticleTitleLinear binary anticodes Electronics Letters. 6 IssueID13 419–421
D. Fon-Der-Flaass (1996) ArticleTitleA note on greedy codes Journal of Combinatorial Theory Series A. 76 156–159 Occurrence Handle10.1006/jcta.1996.0096
VI. Levenstein (1960) ArticleTitleA class of systematic codes Doklady Akademii Nauk. 1 368–371
F.J. MacWilliams N.J.A. Sloane (1988) The Theory of Error-correcting Codes North-Holland Amsterdam
CL. Mallows V. Pless N.J.A. Sloane (1976) ArticleTitleSelf-dual codes over GF(3) Journal of Appled Mathematics. 31 649–665
L. Monroe (1994) ArticleTitleBinary greedy codes Congressus Numerantium. 104 49–63
Monroe L. (1995). Greedy Codes over Binary and Non-binary Fields, Ph.D. thesis, University of Illinois at Chicago
L. Monroe (1996) ArticleTitleSelf-orthogonal Greedy codes Designs, Codes and Crypthography. 9 79–83
VS. Pless (1968) ArticleTitleOn the uniqueness of the Golay codes Journal of Combinatorial Theory. 5 215–228
V.S. Pless WC. Huffman (Eds) (1998) Handbook of Coding Theory, I Elsevier Amsterdam
A. Trachtenberg (2002) ArticleTitleDesigning lexicographic codes with a given trellis complexity IEEE Transaction Information Theory. 48 IssueID1 89–100 Occurrence Handle10.1109/18.971740
van Zanten A.J. Lexicodes over fields of characteristic 2, rept. 93–126, Faculty of Technical Mathematics and Informatics, Delft Universites of Techology, Delft, The Netherlands (1993)
A.J. Zanten Particlevan (1997) ArticleTitleLexicographic order and linearity Designs, Codes and Cryptography. 10 85–97
A.J. Zanten Particlevan IN. Suparta (2003) An algorithm for a large class of linear q-ary lexicodes, rept. CS 03–01, Institute for Knowledge and Agent Technology Universiteit Maastricht Maastricht The Netherlands
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: P. Fitzpatrick
Cassification: 94B05, 94B60
I Nengah Suparta-On leave from Department of Mathematics, IKIP Singaraja, Bali, Indonesia
Rights and permissions
About this article
Cite this article
Zanten, A.J.v., Suparta, I.N. On the Construction of Linear q-ary Lexicodes. Des Codes Crypt 37, 15–29 (2005). https://doi.org/10.1007/s10623-004-3802-x
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-004-3802-x