Results 301 to 310 of about 1,346,123 (313)
Some of the next articles are maybe not open access.
1999
Some elementary concepts of block codes are introduced in Chapter 1. In general, it is known that the encoding and decoding of 2 k codewords of length n can be quite complicated when n and k are large unless the encoder has certain special structures. In this chapter, a class of block codes, called linear block codes, is discussed.
Xuemin Chen, Irving S. Reed
openaire +2 more sources
Some elementary concepts of block codes are introduced in Chapter 1. In general, it is known that the encoding and decoding of 2 k codewords of length n can be quite complicated when n and k are large unless the encoder has certain special structures. In this chapter, a class of block codes, called linear block codes, is discussed.
Xuemin Chen, Irving S. Reed
openaire +2 more sources
1998
Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. We mainly present the basic concepts of encoding and decoding of linear block codes and state some facts without ...
Toru Fujiwara +3 more
openaire +2 more sources
Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. We mainly present the basic concepts of encoding and decoding of linear block codes and state some facts without ...
Toru Fujiwara +3 more
openaire +2 more sources
2014
Sliding-block codes are non-block coding structures consisting of discrete time time-invariant possibly nonlinear filters.
Ulrich Tamm +4 more
openaire +2 more sources
Sliding-block codes are non-block coding structures consisting of discrete time time-invariant possibly nonlinear filters.
Ulrich Tamm +4 more
openaire +2 more sources
Superposition block coded modulation
CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436), 2004In this paper, we introduce a novel superposition coded modulation (SCM) scheme that uses block codes as the component codes. The proposed scheme is termed as superposition block coded modulation (SBCM). An SBCM system example with very simple component codes is presented.
G.Z. Karabulut, Abbas Yongacoglu
openaire +2 more sources
On the trellis structure of block codes
Proceedings of 1994 IEEE International Symposium on Information Theory, 1995The problem of minimizing the vertex count at a given time index in the trellis for a general (nonlinear) code is shown to be NP-complete. Examples are provided that show that (1) the minimal trellis for a nonlinear code may not be observable, i.e. some codewords may be represented by more than one path through the trellis and (2) minimizing the vertex
Frank R. Kschischang, V. Sorokine
openaire +2 more sources
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 +2 more sources
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 +2 more sources
Block-Coded Modulation Based on Set Partitioning of Block Modulation Codes
2006 10th IEEE Singapore International Conference on Communication Systems, 2006We propose a new block-coded modulation scheme. The proposed code construction is based on set partitioning of a block modulation code. In comparison with the traditional scheme based on set partitioning of a two-dimensional signal set, the proposed scheme can achieve similar error performance with much smaller decoding trellis complexity.
openaire +2 more sources
2003
The goal of this chapter is the study of some basic concepts and constructions pertaining to block error-correcting codes, and of their more salient properties, with a strong emphasis on all the relevant algorithmic and computational aspects.
openaire +2 more sources
The goal of this chapter is the study of some basic concepts and constructions pertaining to block error-correcting codes, and of their more salient properties, with a strong emphasis on all the relevant algorithmic and computational aspects.
openaire +2 more sources
Sliding block implementation of block codes (Corresp.)
IEEE Transactions on Information Theory, 1979A sliding block encoding scheme easily derivable from block encoding is presented. It is shown to perform arbitrarily close to the rate distortion function when the source is stationary and memoryless.
openaire +2 more sources