Lower bounds on the minimum distance of long codes in the Lee metric

DOI10.1007/s10623-013-9870-zzbMath1331.94087arXiv1302.2246OpenAlexW2028160655MaRDI QIDQ2256106

Patrick Solé, Hugues Randriambololona, Lin Sok

Publication date: 19 February 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.2246

zbMATH Keywords

Gilbert-Varshamov boundalgebraic-geometric codeLee metric

Mathematics Subject Classification ID

Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Unnamed Item
• Unnamed Item
• On the asymptotic behaviour of Lee-codes
• A note on tamely ramified towers of global function fields
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• Lee-metric BCH codes and their application to constrained and partial-response channels
• Fundamentals of Error-Correcting Codes

This page was built for publication: Lower bounds on the minimum distance of long codes in the Lee metric