Finding the permutation between equivalent binary codes

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 co...

Full description

Saved in:
Bibliographic Details
Main Author: Sendrier, N.
Format: Conference Proceeding
Language:English
Subjects:
Binary codes
Error correction codes
Linear code
Workstations
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ISIT.1997.613303