Information sets as permutation cycles for quadratic residue codes
The two cases p=7 and p=23 are the only known cases where the automorphism group of the [p+1, (p+1)/2] extended binary quadratic residue code, O(p), properly contains PSL(2,p). These codes have some of their information sets represented as permutation cycles from Aut(Q(p)). Analysis proves that al...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1982-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171282000398 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The two cases p=7 and p=23 are the only known cases where the automorphism group of the [p+1, (p+1)/2] extended binary quadratic residue code, O(p), properly contains PSL(2,p). These codes have some of their information sets represented as permutation cycles from Aut(Q(p)). Analysis proves that all information sets of Q(7) are so represented but those of Q(23) are not. |
|---|---|
| ISSN: | 0161-1712 1687-0425 |