Constructions and invariants of optimal codes in the Lee metric

DOI10.1134/s0032946023020011OpenAlexW4390148081MaRDI QIDQ6148189

Faina I. Solov'eva, Ivan Yu. Mogilnykh

Publication date: 11 January 2024

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946023020011

zbMATH Keywords

perfect codediameter perfect codeMollard codeLee metricconcatenation constructionVasil'ev code

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating and decoding perfect linear Lee codes
• Une nouvelle famille de 3-codes parfaits sur GF(q)
• On the generalized concatenated construction for codes in \(L_1\) and Lee metrics
• On perfect and Reed-Muller codes over finite fields
• A concatenation construction for propelinear perfect codes from regular subgroups of \(\mathrm{GA}(r,2)\)
• On non-full-rank perfect codes over finite fields
• Bounds in the Lee metric and optimal codes
• Product Constructions for Perfect Lee Codes
• Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• On perfect codes and related concepts
• An enumeration of 1-perfect ternary codes
• On \(q\)-ary propelinear perfect codes based on regular subgroups of the general affine group
• On weight distributions for a class of codes with parameters of Reed-Muller codes
• Partitions into perfect codes in the Hamming and Lee metrics

This page was built for publication: Constructions and invariants of optimal codes in the Lee metric