 |
 |
|
|
| HAL: inria-00607336, version 1 |
| See detailed view |  BibTeX,EndNote,... |
 |
| WCC 2011 - Workshop on coding and cryptography, Paris : France (2011) |
|
|
|
|
| Construction of New Completely Regular Z2Z4-linear Codes from Old |
|
|
| Josep Rifa 1Lorena Ronquillo 1 |
|
|
| (2011-04) |
|
|
|
| A code C is said to be Z2Z4-additive if its coordinates can be partitioned into two subsets X and Y , in such a way that the punctured code of C obtained by removing the coordinates outside X (or, respec- tively, Y ) is a binary linear code (respectively, a quaternary linear code). The binary image of a Z2Z4-additive code, through the Gray map, is a Z2Z4-linear code, which is not always linear. Given a perfect Z2Z4-linear code, which is known to be completely regular, some constructions yield- ing new Z2Z4-linear codes are computed, and the completely regularity of the obtained codes is studied. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Department of Information and Communications Engineering, Universitat Aut onoma de Barcelona, |
|
|
|
08193-Cerdanyola del Vall es, Spain. |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Cryptography and Security Computer Science/Discrete Mathematics Computer Science/Information Theory and Coding Mathematics/Information Theory |
|
|
| additive codes – completely regular codes – perfect binary codes – Z2Z4-linear codes. |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| inria-00607336, version 1 | |
| http://hal.inria.fr/inria-00607336 | |
| oai:hal.inria.fr:inria-00607336 | |
| From: Assia Saadi | |
| Submitted on: Friday, 8 July 2011 15:37:45 | |
| Updated on: Friday, 8 July 2011 16:18:58 | |
