Perfect codes in the discrete simplex
From MaRDI portal
Publication:2339137
DOI10.1007/s10623-013-9893-5zbMath1393.94946arXiv1307.3142OpenAlexW3104769525MaRDI QIDQ2339137
Dejan Vukobratović, Mladen Kovačević
Publication date: 30 March 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.3142
perfect codesManhattan metricsphere packinginteger codesdiscrete simplexmultiset codespermutation channel
Combinatorics in computer science (68R05) Distance in graphs (05C12) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the existence of perfect constant weight codes
- Enumerating and decoding perfect linear Lee codes
- Nonexistence of face-to-face four-dimensional tilings in the Lee metric
- Tilings in Lee metric
- On perfect Lee codes
- On the construction of perfect deletion-correcting codes using design theory
- Anticodes for the Grassmann and bilinear forms graphs
- Perfect codes in graphs
- Configuration distribution and designs of codes in the Johnson scheme
- Perfect Constant-Weight Codes
- Perfect Single Error-Correcting Codes in the Johnson Scheme
- Coding for Errors and Erasures in Random Network Coding
- Perfect codes hardly exist
- On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
- Nonexistence theorems on perfect Lee codes over large alphabets
- Perfect binary codes: constructions, properties, and enumeration
- On the Nonexistence of Perfect Codes in the Johnson Scheme
- Product Constructions for Perfect Lee Codes
- A Matroid Framework for Noncoherent Random Network Communications
- Error-Correcting Codes in Projective Space
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- On the Nonexistence of Perfect Codes over Finite Fields
- A note on perfect Lee-codes over small alphabets
This page was built for publication: Perfect codes in the discrete simplex
