On the characterization of linear uniquely decodable codes

DOI10.1023/A:1008306605740MaRDI QIDQ1963167zbMATH OpenOpenAlexFDO

Authors Josep Rifà, Gilles Zémor, Gérard Cohen, Juan Tena Ayuso

Publication date 24 January 2000

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

Full work available at URL https://doi.org/10.1023/a:1008306605740

zbMATH Keywords

covering radiusexistencelinear uniquely decodable codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Review text

A uniquely decodable (UD) code is a code such that any vector of the ambient space has a unique closest codeword. After the introduction, in Section 2, the authors investigate the structure of general binary linear UD code and identify perfect subcodes. In Section 3 these results are applied to solve the existence problem for UD codes in the case when the covering radius \(\rho\leq 2\). Finally, nonlinear and nonbinary versions of Section 2 are envisaged.

Recommendations

• scientific article; zbMATH DE number 1498796
• Caractérisation results about L codes
• Publication:4724544
• On the complete decoding of binary linear codes (Corresp.)
• scientific article; zbMATH DE number 3908334
• On the equivalence of linear codes
• On linear rigidity of a class of codes
• A remark on linear codes
• On the reconstruction of linear codes
• scientific article; zbMATH DE number 2161575

Cited in

(9)

• Uniqueness of codes using semidefinite programming
• Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation
• On the set of uniquely decodable codes with a given sequence of code word lengths
• On universally decodable matrices for space-time coding
• On the Existence of Universally Decodable Matrices
• On Unique Decodability
• scientific article; zbMATH DE number 1498796 (Why is no real title available?)
• On the universality of the LZ-based decoding algorithm
• Higher genus universally decodable matrices (UDMG)

This page was built for publication: On the characterization of linear uniquely decodable codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963167)