Results 251 to 260 of about 359,313 (283)
Some of the next articles are maybe not open access.
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
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
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
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
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
Linear block codes over cyclic groups
IEEE Transactions on Information Theory, 1995The concept of geometrically uniformed (GU) code was introduced by \textit{G. D. Forney} [IEEE Trans. Inform. Theory 37, No. 5, 1241-1260 (1991; Zbl 0734.94026).] If \(I\) denotes an index set and \(C\) a subgroup of the Cartesian product group \(G^I\) then a GU code \(C\) is obtained by mapping the codewords \(c \in C\) to signal sequences \(s \in C\)
Giuseppe Caire, Ezio Biglieri
openaire +1 more source
A new genetic decoding of Linear Block Codes
2012 International Conference on Multimedia Computing and Systems, 2012In this paper, we present a new hard-decision decoding technique based on Genetic Algorithms, which is applicable to the more general case where the only known structure is given by the parity-check matrix H. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself.
Ahmed Azouaoui, Mostafa Belkasmi
openaire +1 more source
On non-linear space-time block codes
IEEE International Conference on Acoustics Speech and Signal Processing, 2002A number of space-time block codes have been proposed for the quasi-static, flat-fading channel with coherent receiver. All of these block codes are linear codes, i.e., the encoded codeword is a linear function of the input scalar symbols. Here we propose new non-linear space-time block codes, i.e., the codewords are non-linear functions of the input ...
Sumeet Sandhu +2 more
openaire +1 more source
Erasure correction performance of linear block codes
1994We estimate the probability of incorrect decoding of a linear block code, used over an erasure channel, via its weight spectrum, and define the weight spectra that allow us to achieve the capacity of the channel and the random coding exponent. We derive the erasure correcting capacity of long binary BCH codes with slowly growing distance and their ...
Ilya Dumer, Patrick Guy Farrell
openaire +1 more source