A probabilistic algorithm for computing minimum weights of large error-correcting codes

@article{Leon1988APA,
  title={A probabilistic algorithm for computing minimum weights of large error-correcting codes},
  author={Jeffrey S. Leon},
  journal={IEEE Trans. Information Theory},
  year={1988},
  volume={34},
  pages={1354-1359}
}
Given a binary nonlinear code, we provide a deterministic algorithm to to use probabilistic algorithms for the computation of the minimum distance, such as the there are algorithms which perform much better than brute force, e.g. code with large minimum distance and the minimum weight, of any random binary code. code C over Fq of length n and dimension k capable of correction w errors. A matrix columns that is error-free and where the submatrix composed by this subset is A Probabilistic… CONTINUE READING
Highly Cited
This paper has 191 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 110 extracted citations

Extremal Self-Dual Codes

View 5 Excerpts
Highly Influenced

Information-set decoding for linear codes over Fq

IACR Cryptology ePrint Archive • 2009
View 5 Excerpts
Highly Influenced

Cyclotomy and Duadic Codes of Prime Lengths

IEEE Trans. Information Theory • 1999
View 6 Excerpts
Highly Influenced

192 Citations

01020'91'97'04'11'18
Citations per Year
Semantic Scholar estimates that this publication has 192 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…