[图书][B] Coding theory: algorithms, architectures and applications

A Neubauer, J Freudenberger, V Kuhn - 2007 - books.google.com
One of the most important key technologies for digital communication systems as well as
storage media is coding theory. It provides a means to transmit information across time and …

A logarithmic upper bound on the minimum distance of turbo codes

M Breiling - IEEE Transactions on Information Theory, 2004 - ieeexplore.ieee.org
We derive new upper bounds on the minimum distance, which turbo codes can maximally
attain with the optimum interleaver of a given length. The new bounds grow approximately …

Encoding and distance estimation of product convolutional codes

M Bossert, C Medina… - … Symposium on Information …, 2005 - ieeexplore.ieee.org
We define and investigate the direct product of convolutional codes. Properties of generator
and parity check matrices are considered. Free distance of a product convolutional code is …

Woven codes with outer warp: Variations, design, and distance properties

J Freudenberger, M Bossert, VV Zyablov… - IEEE Journal on …, 2001 - ieeexplore.ieee.org
We consider convolutional and block encoding schemes which are variations of woven
codes with outer warp. We propose methods to evaluate the distance characteristics of the …

Combinatorial analysis of the minimum distance of turbo codes

M Breiling, JB Huber - IEEE Transactions on Information …, 2001 - ieeexplore.ieee.org
In this paper, new upper bounds on the maximum attainable minimum Hamming distance of
turbo codes with arbitrary-including the best-interleavers are established using a …

[PDF][PDF] Serially concatenated convolutional codes with product distance

J Freudenberger, R Jordan, M Bossert… - … Symposium on Turbo …, 2000 - researchgate.net
In this paper we investigate serially concatenated convolutional codes, both with randomly
chosen and designed permutations. We prove that overall minimum distances greater or …

Error exponents for product convolutional codes

C Medina, VR Sidorenko, VV Zyablov - Problems of Information …, 2006 - Springer
An upper bound on the error probability (first error event) of product convolutional codes
over a memoryless binary symmetric channel, and the resulting error exponent are derived …

Adaptability between FM-DCSK and channel coding over fading channels

Y Xia, L Wang, G Chen - 2005 IEEE International Symposium …, 2005 - ieeexplore.ieee.org
FM-DCSK is a non-coherent modulation and demodulation technique that uses chaotic
signals as the carrier. Due to its inherent broadband nature, its good performance of anti …

A linearizing approach to coding for generalized MSK

W AbedIseid - 2007 - ruor.uottawa.ca
Minimum shift keying as an instance of continuous-phase frequency shift keying is a
nonlinear modulation which makes designing error correcting codes for it difficult as …

[引用][C] 编织码编码原理及其分类

魏琴芳, 王琳, 罗智勇 - 无线通信技术, 2004