Sammanfattning
Six new quasi-cyclic codes are presented, which improve thelower bounds on the minimum distance for a binary code. A localexhaustive search is used to find these codes and many other quasi-cycliccodes which attain the lower bounds.
Originalspråk | Engelska |
---|---|
Sidor (från-till) | 1666-1667 |
Antal sidor | 1 |
Tidskrift | IEEE Transactions on Information Theory |
Volym | 40 |
Nummer | 5 |
DOI | |
Status | Publicerad - 1994 |
Externt publicerad | Ja |
Nationell ämneskategori
- Datavetenskap (10201)