Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Minimum distance of elliptic codes
 
research article

Minimum distance of elliptic codes

Shokrollahi, Amin  
1992
Advances in Mathematics

In this paper we investigate three classes of linear codes arising from elliptic curves and compute their minimal distance using implicity the structure of the group of rational points of the curves.

  • Details
  • Metrics
Type
research article
DOI
10.1016/0001-8708(92)90029-K
Author(s)
Shokrollahi, Amin  
Date Issued

1992

Published in
Advances in Mathematics
Volume

93

Issue

2

Start page

251

End page

281

Subjects

Minimal distance

•

Error correction

•

Coding

•

algoweb_agcodes

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
ALGO  
Available on Infoscience
January 16, 2007
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/239454
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés