Lexicodes over rings

DOI10.1007/s10623-012-9791-2zbMath1321.94143arXiv1208.2361MaRDI QIDQ2249801

T. Aaron Gulliver, S. Arash Sheikholeslam, Kenza Guenda

Publication date: 3 July 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.2361

zbMATH Keywords

self-dual codes; codes over rings; Gray map; self-orthogonal codes; greedy codes

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

94B65: Bounds on codes

16T99: Hopf algebras, quantum groups and related topics

Related Items

Lexicodes over finite principal ideal rings, Greedy construction of DNA codes and new bounds

Uses Software

• Z4 database
• Code Tables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lexicographic order and linearity
• Greedy codes
• MDS and self-dual codes over rings
• Forcing linearity on greedy codes
• On the construction of linear \(q\)-ary lexicodes.
• Searching for linear codes with large minimum distance
• Lexicographic codes: Error-correcting codes from game theory
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Fundamentals of Error-Correcting Codes
• On the covering radius of Z/sub 4/-codes and their lattices
• Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code
• Type II codes over F/sub 2/+uF/sub 2/
• OPTIMAL LINEAR CODES OVER ℤ_m