On some perfect codes with respect to Lee metric
From MaRDI portal
Publication:2484232
DOI10.1016/J.LAA.2005.03.001zbMATH Open1079.94017OpenAlexW2065998991MaRDI QIDQ2484232FDOQ2484232
Authors: Sapna Jain, Ki-Bong Nam, Ki-Suk Lee 
Publication date: 1 August 2005
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2005.03.001
Recommendations
Cites Work
- Error Detecting and Error Correcting Codes
- On the Nonexistence of Perfect Codes over Finite Fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of perfect codes
- On the uniqueness of the Golay codes
- On linear and nonlinear single-error-correcting q-nary perfect codes
- Title not available (Why is that?)
- Coding theory
- On Group and Nongroup Perfect Codes in $q$ Symbols.
Cited In (24)
- Partitions into perfect codes in the Hamming and Lee metrics
- MODIFICATION TO A BOUND FOR RANDOM ERROR CORRECTION WITH LEE WEIGHT
- ON THE GENERALIZED-LEE-RT-PSEUDO-METRIC (THE GLRTP-METRIC) ARRAY CODES CORRECTING BURST ERRORS
- Quasi-perfect Lee distance codes
- Title not available (Why is that?)
- A note on perfect Lee-codes over small alphabets
- Fast decoding of quasi-perfect Lee distance codes
- Sufficient Condition over the Number of Parity Checks for Burst Error Detection/Correction in Linear Lee Weight Codes
- On maximum Lee distance codes
- Title not available (Why is that?)
- Correction of CT burst array errors in the generalized-Lee-RT spaces
- On perfect Lee codes
- Title not available (Why is that?)
- On some properties of Lee metric codes.
- Perfect codes with respect to Lee metric
- On the parameters of codes for the Lee and modular distance
- Array codes in the generalized Lee-RT pseudo-metric (GLRTP-metric)
- Title not available (Why is that?)
- Singleton's bound in Euclidean codes
- On a Sufficient Condition to Attain Minimum Square Distance in Euclidean Codes
- Code design of \(l_{t_i/n_i}\)-ispotty-byte error correcting \(\theta\)-codes
- Weighted perfect codes in Lee metric
- Enumerating and decoding perfect linear Lee codes
- Error-correcting codes and Minkowski's conjecture
This page was built for publication: On some perfect codes with respect to Lee metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484232)
