Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
468
On Codes of Bounded Trellis Complexity *
"... Abstract-In this paper, we initiate a structure theory of linear codes with bounded trellis complexity. The theory is based on the observation that the family of linear codes over Fq, some permutation of which has trellis state-complexity at most w, is a minor-closed family. It then follows from a ..."
Abstract
- Add to MetaCart
Abstract-In this paper, we initiate a structure theory of linear codes with bounded trellis complexity. The theory is based on the observation that the family of linear codes over Fq, some permutation of which has trellis state-complexity at most w, is a minor-closed family. It then follows from a
On the Trellis Complexity of Composite-Length Cyclic Codes
"... Absfroct- The trellis complexity of block codes is closely related to their soft-decision decoding complexity. We investigate the trellis properties of composite-length cyclic codes. Trelliis-oriented decompositions are presented, and improved upper bounds on the trellis complexity are derived. I. ..."
Abstract
- Add to MetaCart
Absfroct- The trellis complexity of block codes is closely related to their soft-decision decoding complexity. We investigate the trellis properties of composite-length cyclic codes. Trelliis-oriented decompositions are presented, and improved upper bounds on the trellis complexity are derived. I.
Lower bounds on trellis complexity of block codes
- IEEE 2hns. Inform. Theory
, 1995
"... Abstruct-The trellis state-complexity s of a linear block code is defined as the logarithm of the maximum number of states in its minimal trellis. We present a new lower bound on the statecomplexity of linear codes, which includes most of the existing bounds as special cases. The new bound is obtain ..."
Abstract
-
Cited by 28 (5 self)
- Add to MetaCart
Abstruct-The trellis state-complexity s of a linear block code is defined as the logarithm of the maximum number of states in its minimal trellis. We present a new lower bound on the statecomplexity of linear codes, which includes most of the existing bounds as special cases. The new bound
Designing Lexicographic Codes With Given Trellis Complexity
- IEEE Trans. Inform. Theory IT-48
, 2001
"... We generalize constructions of lexicographic codes to produce locally optimal codes with a desired trellis decoding complexity. These constructions are efficient for high rate codes and provide a means for automated code design. As a byproduct, we improve known bounds on the parameters of lexicodes. ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
We generalize constructions of lexicographic codes to produce locally optimal codes with a desired trellis decoding complexity. These constructions are efficient for high rate codes and provide a means for automated code design. As a byproduct, we improve known bounds on the parameters of lexicodes.
Lexicographic Codes: Constructions Bounds, and Trellis Complexity
- in Proc. 31st Annual Conference on Information Sciences and Systems
, 1997
"... We study lexicographic codes, which are generated by an iterative greedy construction. We analyze the relationship between successive iterations in this construction, and derive bounds on the parameters of the resulting codes that are tighter than the presently known bounds. Furthermore, we generali ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
decoding complexity is locally optimized. We also show how to construct generalized lexicographic codes whose trellis state-complexity satisfies a prescribed bound. Fuller version in IEEE Trans. Inf. Theory, expected 1/2002.
On the Trellis Complexity of Certain Binary Linear Block Codes
"... investigated, in the case where the weights of nonzero codewords in g ..."
On the Intractability of Permuting a Block Code to Minimize Trellis Complexity
- IEEE Trans. Inform. Theory
"... An important problem in the theory and application of block code trellises is to find a coordinate permutation of a given code to minimize the trellis complexity. In this paper we show that the problem of finding a coordinate permutation that minimizes the number of vertices at a given depth in the ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
An important problem in the theory and application of block code trellises is to find a coordinate permutation of a given code to minimize the trellis complexity. In this paper we show that the problem of finding a coordinate permutation that minimizes the number of vertices at a given depth
Space-time codes for high data rate wireless communication: Performance criterion and code construction
- IEEE TRANS. INFORM. THEORY
, 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract
-
Cited by 1782 (28 self)
- Add to MetaCart
for high data rate wireless communication. The encoding/decoding complexity of these codes is comparable to trellis codes employed in practice over Gaussian channels. The codes constructed here provide the best tradeoff between data rate, diversity advantage, and trellis complexity. Simulation results
Results 1 - 10
of
468
