Name
Abstract | ||
|---|---|---|
Recently the notion on binary codes called Z4-linearity was introduced. This notion explains why Kerdock codes and Delsarte-Goethals codes admit formal duals in spite of their nonlinearity. The “Z4-duals” of these codes (called “Preparata” and “Goethals” codes) are new nonlinear codes which admit simpler decoding algorithms than the previously known formal duals (the generalized Preparata and Goethals codes). We prove, by using the notion of exact weight enumerator, that the relationship between any Z4-linear code and its Z4 -dual is stronger than the standard formal duality and we deduce the weight enumerators of related generalized codes |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1109/18.412694 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
exact weight enumerator,formal dual,linear codes,z4-linearity,generalized preparata,delsarte-goethals code,kerdock codes,standard formal duality,error correction codes,nonlinear codes,kerdock code,formal duals,nonlinearity,related generalized code,generalized codes,goethals codes,decoding algorithms,error correcting codes,binary codes,goethals code,z4-duality,weight enumerators,z4-linear code,preparata codes,decoding,dual codes,delsarte-goethals codes,indexing terms,linear code,error correction code | Journal | 41 |
Issue | ISSN | Citations |
5 | 0018-9448 | 4 |
PageRank | References | Authors |
0.83 | 0 | 1 |