Results 231 to 240 of about 390,939 (260)
Concatenated codes, matrix-product codes and their schur product [PDF]
, 2021 The aim of thesis is two-fold. Firstly, we introduce concatenated codes, matrixproduct codes and elaborate on their relation. It is known that a matrix-product code can be seen as a concatenated code. We give a proof of this fact. Conversely, we show how a particular concatenated code can be viewed as a matrix-product code.
openaire
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Broadcasting, 2006
In this paper, a turbo-product-coded, quadrature-vestigial-sideband (QVSB), digital modulation and coding scheme are presented. This scheme is more complex than the VSB modulation and coding format employed for high-definition television; and it achieves spectral-efficiency performance within 4 to 5dB of the Shannon-Bound, with relatively conservative ...
John Poklemba, David Wenzel
openaire +1 more source
In this paper, a turbo-product-coded, quadrature-vestigial-sideband (QVSB), digital modulation and coding scheme are presented. This scheme is more complex than the VSB modulation and coding format employed for high-definition television; and it achieves spectral-efficiency performance within 4 to 5dB of the Shannon-Bound, with relatively conservative ...
John Poklemba, David Wenzel
openaire +1 more source
Combinatorica, 2007
What is the maximum possible number, f3(n), of vectors of length n over {0,1,2} such that the Hamming distance between every two is even? What is the maximum possible number, g3(n), of vectors in {0,1,2}n such that the Hamming distance between every two is odd?
Noga Alon, Eyal Lubetzky
openaire +1 more source
What is the maximum possible number, f3(n), of vectors of length n over {0,1,2} such that the Hamming distance between every two is even? What is the maximum possible number, g3(n), of vectors in {0,1,2}n such that the Hamming distance between every two is odd?
Noga Alon, Eyal Lubetzky
openaire +1 more source
Asymptotic performance of product codes
1999 IEEE International Conference on Communications (Cat. No. 99CH36311), 2003This paper presents the asymptotic performance of Hamming and extended Hamming product codes for the binary symmetric channel and the additive white Gaussian noise (AWGN) channel. Simulation results for very low complexity high dimensional single parity check product codes on the AWGN channel are also given.
David M. Rankin, T. Aaron Gulliver
openaire +1 more source
Chaos for Speech Coding and Production
2011The presence of nonlinearity and chaotic behavior in the human speech production system has been reported previously; however to date chaotic dynamics has not been widely exploited in speech coding and artificial speech production algorithms. In this paper we illustrate how we can utilize chaotic dynamics in speech coding and synthesis and discuss how ...
Behnam Kia +2 more
openaire +1 more source
Trellis Properties of Product Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2005In this paper, we study trellis properties of the tensor product (product code) of two linear codes, and prove that the tensor product of the lexicographically first bases for two linear codes in minimal span form is exactly the lexicographically first basis for their product code in minimal span form, also the tensor products of characteristic ...
Kan, H., Shen, H.
openaire +3 more sources
Analog decoding of product codes
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494), 2002A design approach is presented for soft-decision decoding of block product codes ("block turbo codes") using analog computation with MOS devices. Application of analog decoding to large code sizes is also considered with the introduction of serial analog interfaces and pipeline schedules.
Chris Winstead +3 more
openaire +1 more source
Quantum Information Processing, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Product codes and the singleton bound
1994Minimum distance is not always the most determinant factor to acheive high performance for error correction. Of course the knowledge of the whole weight distribution of the code is more accurate than the knowledge of the mere minimum distance, and the phenomenon amplifies for a high noise level.
openaire +1 more source
ASYMMETRIC QUANTUM PRODUCT CODES
International Journal of Quantum Information, 2012A family of asymmetric quantum codes derived from the product code of two (classical) Reed–Solomon (RS) codes is constructed in this paper. This family is constructed by applying the Calderbank–Shor–Steane (CSS) construction. The proposed codes can be utilized in quantum channels having great asymmetry, that is, quantum channels in which the ...
openaire +1 more source