Experimental results for two implementations of a probabilistic algorithm for minimum distance of linear codes

Authors:
Iliya Bouyukliev;Venelin Monev
Affiliations:
Bulgarian Academy of Sciences, Veliko Tarnovo, Bulgaria;Veliko Tarnovo University, Veliko Tarnovo, Bulgaria
Venue:
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Year:
2010

Citing 5
Cited 0

An observation on the security of McEliece's public-key cryptosystem

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A new identification scheme based on syndrome decoding

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
The intractability of computing the minimum distance of a code

IEEE Transactions on Information Theory
A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

IEEE Transactions on Information Theory
A probabilistic algorithm for computing minimum weights of large error-correcting codes

IEEE Transactions on Information Theory - Part 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers probabilistic algorithms for minimum distance of linear codes. Two implementations of a probabilistic algorithm of Leon's type are developed. Some experimental results for our implementations are presented.