Results 311 to 320 of about 5,975,260 (378)
Some of the next articles are maybe not open access.
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
Block codes for Bernoulli shifts
Israel Journal of Mathematics, 1984zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
ROI coding with separated code block
2005 International Conference on Machine Learning and Cybernetics, 2005ROI coding can effectively improve the subjective quality of image. There are some known disadvantages in existing ROI coding methods. This paper presents a new ROI coding method based code block selection mechanism. The method is to separate ROI and background data, and to place them to individual code blocks, ROI code block and background code block,
Yun Xie, Guoqiang Han
openaire +2 more sources
Block truncation coding with entropy coding
IEEE Transactions on Communications, 1995Block truncation coding (BTC) is a simple and fast image compression algorithm which achieves a constant bit rate of 2.0 bits per pixel. The method is however suboptimal. We propose a modification of BTC in which the compression ratio is improved by coding the quantization data and the bit plane by arithmetic coding with an adaptive modelling scheme ...
Pasi Fränti, Olli Nevalainen
openaire +2 more sources
Minimal trellises for block codes
IEEE Transactions on Information Theory, 1988Basic concepts in the study of trellises of block codes are defined. It is shown that minimal proper trellises exist for all block codes. Bounds on the sizes of such trellises are established. These bounds are shown to be exact for maximum distance separable codes and nearly so for perfect codes.
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
Synchronization methods for block codes
IEEE Transactions on Information Theory, 1962Summary: Efficient use of block codes to communicate over a telemetry channel is dependent upon the knowledge of the instants, in time, that one code waveform, or code word, ends and the succeeding waveform begins. This word synchronization is the subject of concern in this paper.
openaire +2 more sources
A quasi-orthogonal space-time block code
2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540), 2000H. Jafarkhani
semanticscholar +1 more source
IEEE Transactions on Information Theory, 1975
The traditional Shannon theory focuses almost exclusively on block coding techniques, that is, source and channel codes that consist of mapping blocks of nonoverlapping data into blocks of encoded data. Such codes (1) have undesirable probabilistic properties such as loss of stationarity and ergodicity, (2) do not include several practical ...
openaire +3 more sources
The traditional Shannon theory focuses almost exclusively on block coding techniques, that is, source and channel codes that consist of mapping blocks of nonoverlapping data into blocks of encoded data. Such codes (1) have undesirable probabilistic properties such as loss of stationarity and ergodicity, (2) do not include several practical ...
openaire +3 more sources