| Full text | |
| Author(s): |
Cardell, Sara D.
;
Napp, Diego
;
Firer, Marcelo
;
IEEE
Total Authors: 4
|
| Document type: | Journal article |
| Source: | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT); v. N/A, p. 5-pg., 2019-01-01. |
| Abstract | |
In this work we introduce the concept of Unrestricted Generalized Column Distance (UGCD) for convolutional codes. This is the concept equivalent to the generalized Hamming weights for block codes. We show that the hierarchy of UGCD is strictly increasing and show how to compute it of parity-check matrix in general form. We also provide a way to compute it out of a systematic parity-check matrix. (AU) | |
| FAPESP's process: | 15/07246-0 - Construction, decoding and implementation of F_q linear codes. Performanca of SPC product codes and cryptanalysis of the shrinking generators. |
| Grantee: | Sara Díaz Cardell |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 13/25977-7 - Security and reliability of Information: theory and practice |
| Grantee: | Marcelo Firer |
| Support Opportunities: | Research Projects - Thematic Grants |