Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
trellis complexity
Description:
A measure of the size or structural complexity of a trellis representation of a block code in coding theory.
Primary topic:
Error Correcting Code Techniques (51%)
Related topics:
Error Correcting Code Techniques (51%),
Coding theory and cryptography (28%),
Advanced Wireless Communication Techniques (16%)
OpenAlex ID:
keywords/trellis-complexity
Dimension/length profiles and trellis complexity of linear block codes
1994
·
G.D. Forney
·
IEEE Transactions on Information Theory
·
287
Noncoherent sequence detection
1999
·
G. Colavolpe
, R. Raheli
·
IEEE Transactions on Communications
·
178
Concatenation of space-time block codes and "turbo"-TCM
2003
·
G. Bauch
·
International Conference on Communications
·
164
The trellis complexity of convolutional codes
1996
·
R.J. McEliece
, Wei Lin
·
IEEE Transactions on Information Theory
·
126
PDF
An efficient space-frequency coded OFDM system for broadband wireless communications
2003
·
Yi Gong
, Khaled Ben Letaief
·
IEEE Transactions on Communications
·
100
Space-frequency-time coded OFDM for broadband wireless communications
2002
·
Yi Gong
, K.B. Letaief
·
Globecom
·
83
Soft-input soft-output decoding of linear block codes based on ordered statistics
2002
·
M.P.C. Fossorier
, Shu Lin
·
Globecom
·
77
Interleaver properties and their applications to the trellis complexity analysis of turbo codes
2001
·
R. Garello
, G. Montorsi
, et al.
·
IEEE Transactions on Communications
·
64
Lower bounds on trellis complexity of block codes
1995
·
A. Lafourcade
, A. Vardy
·
IEEE Transactions on Information Theory
·
60
Density/length profiles and trellis complexity of lattices
1994
·
G.D. Forney
·
IEEE Transactions on Information Theory
·
57
Signal processing and coding for two-dimensional optical storage
2004
·
A.H.J. Immink
, W.M.J. Coene
, et al.
·
Globecom
·
52
Asymptotically good codes have infinite trellis complexity
1995
·
A. Lafourcade
, A. Vardy
·
IEEE Transactions on Information Theory
·
49
Parallel trellis Viterbi algorithm for sparse channels
1998
·
N.C. McGinty
, R.A. Kennedy
, et al.
·
IEEE Communications Letters
·
45
An efficient space-frequency coded wideband OFDM system for wireless communications
2003
·
Y. Gong
, K.B. Letaief
·
International Conference on Communications
·
41
On (n, n-1) convolutional codes with low trellis complexity
2002
·
Hung-Hua Tang
, Mao-Chao Lin
·
IEEE Transactions on Communications
·
35
On the intractability of permuting a block code to minimize trellis complexity
1996
·
G.B. Horn
, F.R. Kschischang
·
IEEE Transactions on Information Theory
·
32
Convolutional codes under a minimal trellis complexity measure
2009
·
B.F. Uchoa-Filho
, R.D. Souza
, et al.
·
IEEE Transactions on Communications
·
30
Trellis complexity and minimal trellis diagrams of lattices
1998
·
A.H. Banihashemi
, I.F. Blake
·
IEEE Transactions on Information Theory
·
26
Suboptimal decoding of linear codes: partition technique
1996
·
I. Dumer
·
IEEE Transactions on Information Theory
·
26
On maximum length convolutional codes under a trellis complexity constraint
2004
·
Eirik Rosnes
, Øyvind Ytrehus
·
Journal of Complexity
·
25
PDF
Construction of minimal tail-biting trellises
2002
·
R. Kotter
, A. Vardy
·
IEEE Information Theory Workshop (ITW)
·
24
The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes
1996
·
Y. Berger
, Y. Be'ery
·
IEEE Transactions on Information Theory
·
22
A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes
2002
·
H. Griesser
, V. R. Sidorenko
·
Problems of Information Transmission
·
20
Trellis complexity versus the coding gain of lattices. I
1996
·
V. Tarokh
, I.F. Blake
·
IEEE Transactions on Information Theory
·
20
Weight distributions and weight hierarchies of two classes of binary linear codes
2021
·
Fei Li
, Xiumei Li
·
Finite Fields and Their Applications
·
19
Show more works
View as search
Works count:
194
Citation count:
2,273
Year
Topic
Type