Z4-Linear Perfect Codes
| dc.creator | Krotov, Denis | |
| dc.date | 2007-10-01 | |
| dc.date.accessioned | 2026-07-07T09:37:48Z | |
| dc.date.available | 2026-07-07T09:37:48Z | |
| dc.description | For every $n = 2^k > 8$ there exist exactly $[(k+1)/2]$ mutually nonequivalent $Z_4$-linear extended perfect codes with distance 4. All these codes have different ranks. | |
| dc.description | 15p. Bibliography updated | |
| dc.identifier | https://arxiv.org/abs/0710.0198 | |
| dc.identifier | http://arxiv.org/abs/0710.0198 | |
| dc.identifier | transl. from: Diskretn. Anal. Issled. Oper. Ser.1., 7(4) 2000, 78-90 [Russian] | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160588 | |
| dc.subject | Information Theory | |
| dc.title | Z4-Linear Perfect Codes | |
| dc.type | text |