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

Authors:
J. S. Leon
Affiliations:
Dept. of Math., Stat. & Comput. Sci., Illinois Univ., Chicago, IL
Venue:
IEEE Transactions on Information Theory - Part 1
Year:
2006

Citing 0
Cited 6

Permutation group algorithms based on partitions, I: Theory and algorithms

Journal of Symbolic Computation - Special issue on computational group theory: part 2
A New Identification Scheme Based on Syndrome Decoding

CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Semantic security for the McEliece cryptosystem without random oracles

Designs, Codes and Cryptography
A method for efficiently computing the number of codewords of fixed weights in linear codes

Discrete Applied Mathematics
Blind detection of interleaver parameters

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

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm is developed that can be used to find, with a very low probability of error (10-100 or less in many cases), the minimum weights of codes far too large to be treated by any known exact algorithm. The probabilistic method is used to find minimum weights of all extended quadratic residue codes of length 440 or less. The probabilistic algorithm is presented for binary codes, but it can be generalized to codes over GF(q) with q>2