Partitions into perfect codes in the Hamming and Lee metrics
From MaRDI portal
Publication:6173462
DOI10.1134/s003294602203005xzbMath1530.94063OpenAlexW4312982740MaRDI QIDQ6173462
Publication date: 21 July 2023
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s003294602203005x
partitionsperfect codediameter perfect code in Lee metricpartitions into perfect codesperfect code in Hamming metricperfect code in Lee metric
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerating and decoding perfect linear Lee codes
- Fast decoding of quasi-perfect Lee distance codes
- On the non-existence of extended 1-perfect codes and MDS codes
- Nonexistence of perfect 2-error-correcting Lee codes in certain dimensions
- A General Product Construction for Error Correcting Codes
- On the Number of $1$-Perfect Binary Codes: A Lower Bound
- Intersection matrices for partitions by binary perfect codes
- Product Constructions for Perfect Lee Codes
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- On perfect codes and related concepts
This page was built for publication: Partitions into perfect codes in the Hamming and Lee metrics