On the characterization of linear uniquely decodable codes
From MaRDI portal
Publication:1963167
DOI10.1023/A:1008306605740zbMATH Open0938.94013OpenAlexW1520958962MaRDI QIDQ1963167FDOQ1963167
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
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
Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cited In (8)
- On universally decodable matrices for space-time coding
- On the Existence of Universally Decodable Matrices
- Title not available (Why is that?)
- On the set of uniquely decodable codes with a given sequence of code word lengths
- Higher genus universally decodable matrices (UDMG)
- On the universality of the LZ-based decoding algorithm
- On Unique Decodability
- Uniqueness of codes using semidefinite programming
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)
