DocumentCode
3060985
Title
Finding the permutation between equivalent binary codes
Author
Sendrier, Nicolas
Author_Institution
Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
367
Abstract
We present here an algorithm able to compute the permutation between two given equivalent binary linear codes. The algorithm only works if the automorphism group of the considered codes is trivial, that is reduced to the identity permutation. For random codes of length 1000 and dimension 500, the computation time needed is about one second on a workstation DEC alpha 500/266
Keywords
computational complexity; error correction codes; linear codes; algorithm; automorphism group; computation time; equivalent binary codes; equivalent codes; error-correcting codes; identity permutation; linear codes; random codes; workstation DEC alpha 500/266; Binary codes; Error correction codes; Linear code; Workstations;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613303
Filename
613303
Link To Document