Differential convolutionalcodes with designed Hamming distance are defined, and an algebraic decoding algorithm, inspired by Peterson-Gorenstein-Zierler's algorithm, is designed for them.
Differential convolutionalcodes with designed Hamming distance are defined, and an algebraic decoding algorithm, inspired by Peterson-Gorenstein-Zierler's algorithm, is designed for them.
We show that, for convolutionalcodes endowed with a cyclic structure, it is possible to define and compute two sequences of positive integers, called cyclic column and row distances, which present a more regular beha...
详细信息
We show that, for convolutionalcodes endowed with a cyclic structure, it is possible to define and compute two sequences of positive integers, called cyclic column and row distances, which present a more regular behavior than the classical column and row distance sequences. We then design an algorithm for the computation of the free distance based on the calculation of the cyclic column distance sequence. (C) 2019 Elsevier Ltd. All rights reserved.
We show that, for cyclic convolutional codes, it is possible to compute a sequence of positive integers, called cyclic column distances, which presents a more regular behavior than the classical column distances seque...
详细信息
ISBN:
(纸本)9781450355506
We show that, for cyclic convolutional codes, it is possible to compute a sequence of positive integers, called cyclic column distances, which presents a more regular behavior than the classical column distances sequence. We then design an algorithm for the computation of the free distance based on the calculation of this cyclic column distances sequence.
暂无评论