Sciweavers

7 search results - page 1 / 2
» On the Trellis Representation of the Delsarte-Goethals Codes
Sort
View
TIT
1998
55views more  TIT 1998»
13 years 4 months ago
On the Trellis Representation of the Delsarte-Goethals Codes
— In this correspondence, the trellis representation of the Kerdock and Delsarte–Goethals codes is addressed. It is shown that the states of a trellis representation of DG(m; ...
Yaron Shany, Ilan Reuven, Yair Be'ery
DCC
2001
IEEE
14 years 4 months ago
Trellis Structure and Higher Weights of Extremal Self-Dual Codes
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
Houshou Chen, John T. Coffey
ICASSP
2011
IEEE
12 years 8 months ago
A new trellis representation for source-channel rate allocation
In this paper, we consider the source-channel rate allocation for different transmission schemes. We propose a new trellis structure and a new algorithm that are able to deal with...
Romain Tajan, Charly Poulliat, Rodrigue Imad, Inba...
CORR
2007
Springer
85views Education» more  CORR 2007»
13 years 4 months ago
The star trellis decoding of Reed-Solomon codes
The new method for Reed-Solomon codes decoding is introduced. The method is based on the star trellis decoding of the binary image of Reed-Solomon codes. I. THE GOLAY CODE IN STAR...
Sergei Fedorenko
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 4 months ago
Matroid Pathwidth and Code Trellis Complexity
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
Navin Kashyap