Skip to Main content Skip to Navigation
Journal articles

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

Hugues Randriambololona 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 metadata
https://hal.telecom-paris.fr/hal-02286807
Contributor : TelecomParis HAL Connect in order to contact the contributor
Submitted on : Friday, September 13, 2019 - 4:13:17 PM
Last modification on : Monday, January 24, 2022 - 8:26:28 AM

Identifiers

  • HAL Id : hal-02286807, version 1

Collections

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

Citation

Hugues Randriambololona, 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 Datacite

Share

Metrics

Record views

31