Header

UZH-Logo

Maintenance Infos

On the generalized Hamming weights of convolutional codes


Rosenthal, J; York, E (1997). On the generalized Hamming weights of convolutional codes. IEEE Transactions on Information Theory, 43(1):330-335.

Abstract

Motivated by applications in cryptology, Wei (1991) introduced the concept of a generalized Hamming weight for a linear block code. In this correspondence, we define generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convolutional codes having a generator matrix G(D) with bounded Kronecker indices we are able to derive upper and lower bounds on the weight hierarchy

Abstract

Motivated by applications in cryptology, Wei (1991) introduced the concept of a generalized Hamming weight for a linear block code. In this correspondence, we define generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convolutional codes having a generator matrix G(D) with bounded Kronecker indices we are able to derive upper and lower bounds on the weight hierarchy

Statistics

Altmetrics

Downloads

51 downloads since deposited on 16 Mar 2010
6 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Uncontrolled Keywords:bounded Kronecker indices , convolutional codes , cryptology , generalized Hamming weights , generator matrix , linear block code , lower bounds , upper bounds , weight hierarchy
Language:English
Date:1997
Deposited On:16 Mar 2010 11:11
Last Modified:05 Apr 2016 13:26
Publisher:IEEE
ISSN:0018-9448
Publisher DOI:https://doi.org/10.1109/18.567750

Download

Download PDF  'On the generalized Hamming weights of convolutional codes'.
Preview
Filetype: PDF
Size: 1MB
View at publisher