Skip to Main content Skip to Navigation
Journal articles

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

Hugues Randriam 1, 2 L. Sok 3, 4 Patrick Solé 3, 4
1 MC2 - Mathématiques discrètes, Codage et Cryptographie
LTCI - Laboratoire Traitement et Communication de l'Information
2 INFRES - Département Informatique et Réseaux
3 COMNUM - Communications Numériques
LTCI - Laboratoire Traitement et Communication de l'Information
4 COMELEC - Département Communications & Electronique
Document type :
Journal articles
Complete list of metadatas
https://hal.telecom-paris.fr/hal-02286807
Contributor : Telecomparis Hal <>
Submitted on : Friday, September 13, 2019 - 4:13:17 PM
Last modification on : Friday, July 31, 2020 - 11:28:04 AM

Identifiers

  • HAL Id : hal-02286807, version 1

Collections

INSMI | LTCI | PARISTECH | INSTITUT-TELECOM | COMELEC | INFRES | COMNUM | MC2 | UNIV-PARIS-SACLAY

Citation

Hugues Randriam, L. Sok, Patrick Solé. Lower bounds on the minimum distance of long codes in the Lee metric. Designs, Codes and Cryptography, Springer Verlag, 2015, 74 (2), pp.441-452. ⟨hal-02286807⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

37