Results 221 to 230 of about 40,762 (259)
Some of the next articles are maybe not open access.
The (d,k) subcode of a linear block code
IEEE Transactions on Information Theory, 1992Summary: A simple technique employing linear block codes to construct \((d,k)\) error-correcting block codes is considered. This scheme allows asymptotically reliable transmission at rate \(R\) over a BSC channel with capacity CBSC provided \(R\leq C_{d,k}-(1+CBSC)\), where \(C_{d,k}\) is the maximum entropy of a \((d,k)\) source.
Ara Patapoutian, P. Vijay Kumar
openaire +2 more sources
A New Linear Programming Approach to Decoding Linear Block Codes
IEEE Transactions on Information Theory, 2008Summary: In this paper, we propose a new linear programming formulation for the decoding of general linear block codes. Different from the original formulation given by Feldman, the number of total variables to characterize a parity-check constraint in our formulation is less than twice the degree of the corresponding check node.
Kai Yang 0001 +2 more
openaire +1 more source
Linear block codes for error detection
IEEE Trans. Inf. Theory, 1983Summary: The probability of undetected error of linear block codes for use on a binary symmetric channel is investigated. Upper bounds are derived. Several classes of linear block codes are proved to have good error-detecting capability.
Tadao Kasami +2 more
openaire +1 more source
New ternary and quaternary linear block codes
IEEE Transactions on Information Theory, 1996Summary: We present several new ternary and quaternary codes found with a heuristic search procedure, originally proposed by the authors to find good binary codes, and which is based on combinatorial optimization.
Amir Said, Reginaldo Palazzo Júnior
openaire +1 more source
2019
In this chapter, we will explain the construction of linear block codes. Since linear block codes are vector subspaces, we advise to the reader to study Chap. 1 before proceeding to Chap. 2. Without the knowledge of basic concepts of linear algebra, such as groups, fields, vector spaces, and subspaces, it is difficult to comprehend the philosophy ...
openaire +1 more source
In this chapter, we will explain the construction of linear block codes. Since linear block codes are vector subspaces, we advise to the reader to study Chap. 1 before proceeding to Chap. 2. Without the knowledge of basic concepts of linear algebra, such as groups, fields, vector spaces, and subspaces, it is difficult to comprehend the philosophy ...
openaire +1 more source
Optimum distance profiles of linear block codes
2008 IEEE International Symposium on Information Theory, 2008In this paper, two kinds of optimum distance profiles of linear block codes are introduced to study how to include or exclude some basis codewords one by one while keeping the minimum distances (of the generated subcodes) as large as possible. One application is to serve a suitable code for the realization of the transport format combination indicators
A. J. Han Vinck, Yuan Luo 0003
openaire +1 more source
An Improved A* Algorithm for Decoding Linear Block Codes
2010 IEEE Wireless Communication and Networking Conference, 2010In this paper, a modified version of the A* algorithm for decoding linear block codes is proposed. By employing the early acquired information for some parity bits, we can improve the efficiency of the A* decoding algorithm.
Mao-Chao Lin, Chia-Fu Chang
openaire +1 more source
IEEE Trans. Inf. Theory, 1987
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a greater minimum distance than any previously known binary code of the same length and dimension [8]. A detailed description of one of the constructions is given.
openaire +1 more source
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a greater minimum distance than any previously known binary code of the same length and dimension [8]. A detailed description of one of the constructions is given.
openaire +1 more source
Linear toeplitz space time block codes
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005In this paper we consider coherent flat fading wireless communication systems with multiple transmitter antennas and single receiver antenna (MISO). We propose a Toeplitz linear space time block code (STBC) that converts an original MISO flat fading channel into a Toeplitz virtual multiple inputs multiple outputs (MIMO) channel.
Jian-Kang Zhang 0002 +2 more
openaire +1 more source
Bounds on the trellis size of linear block codes
IEEE Transactions on Information Theory, 1993Summary: The size of minimal trellis representation of linear block codes is addressed. Two general upper bounds on the trellis size, based on the zero-concurring codewords and the contraction index of the subcodes are presented. The related permutations for attaining the bounds are exhibited.
Yuval Berger, Yair Be'ery
openaire +2 more sources