On maximum Lee distance codes

DOI10.1155/2013/625912zbMath1294.94101WikidataQ58919936 ScholiaQ58919936MaRDI QIDQ2249930

Svenja Huntemann, Tim L. Alderson

Publication date: 4 July 2014

Published in: Journal of Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/625912

zbMATH Keywords

bound; Lee weight; Hamming metric; block code; Lee distance code

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

94B65: Bounds on codes

94B60: Other types of codes

Related Items

Bounds in the Lee metric and optimal codes

Cites Work

• Unnamed Item
• Unnamed Item
• Codes over \(\mathbb{Z}_{2^k}\), Gray map and self-dual codes
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• Maximum distance separable codes and arcs in projective spaces
• Complementary Sets, Generalized Reed–Muller Codes, and Power Control for OFDM
• Lee-metric BCH codes and their application to constrained and partial-response channels
• Interleaving schemes for multidimensional cluster errors
• Maximum distance codes over rings of order 4
• Error-Correction of Multidimensional Bursts
• Codes in Permutations and Error Correction for Rank Modulation
• An upper bound on minimum distance for a k-ary code
• On channels and codes for the Lee metric
• Singleton bounds for codes over finite rings