Integral lexicographic codes
From MaRDI portal
The aim of this paper is to present the integral lexicographic codes. At the beginning one states the lexicode theorem in a new and very easy way. The lexicode axiom refers to natural coordinatewise definitions of addition and scalar multiplication of codewords. The author gives some interesting examples of particular integral lexicodes and explains some tricks that are successful in computing them. In this paper some recent results of David Herscovici on minimum distance lexicographic codes and his work on distance lexicographic codes are described.
Recommendations
- Integral lexicographic codes
- Large constant dimension codes and lexicodes
- Lexicographic integers
- A selection of divisible lexicographic codes
- Lexicodes over finite principal ideal rings
- On the lexicographical generation of compressed codes
- Lexicodes over rings
- Generalized Integrated Interleaved Codes
- An Integer Program for Codes
- Encoding and Indexing of Lattice Codes
Cites work
Cited in
(8)- Complexity, appeal and challenges of combinatorial games
- Naive configurations
- On the construction of linear \(q\)-ary lexicodes.
- Minimal distance lexicographic codes over an infinite alphabet
- Integral lexicographic codes
- scientific article; zbMATH DE number 3948152 (Why is no real title available?)
- A selection of divisible lexicographic codes
- Greedy codes
This page was built for publication: Integral lexicographic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751628)
