Publication

Minimum distance of elliptic codes

Mohammad Amin Shokrollahi
1992
Journal paper

Abstract

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.

Official source

https://infoscience.epfl.ch/record/99180?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Minimum distance of elliptic codes

Graph Chatbot

Chat with Graph Search

Rational Points in the Noether-Lefschetz Locus of Moduli Spaces of K3 Surfaces

Disagreement and fragmentation in growing groups

Effect of Different Communication Affordances on the Emergence of Collaboration Strategies in an Online Multiplayer Game

Effect of Different Communication Affordances on the Emergence of Collaboration Strategies in an Online Multiplayer Game

Disagreement and fragmentation in growing groups

Rational Points in the Noether-Lefschetz Locus of Moduli Spaces of K3 Surfaces