Results 301 to 310 of about 5,975,260 (378)
Some of the next articles are maybe not open access.
Block codes for statistical synchronization
IEEE Transactions on Information Theory, 1970The performance of a class of block codes with unbounded synchronization delay, though finite average synchronization delay, is analyzed. Basically the synchronizer inspects the code symbol stream for the first occurrence of one of a set of sequences that appear in only one timing position relative to true sync.
R. Storwick, Robert A. Scholtz
openaire +2 more sources
On the construction of group block codes
Annales Des Télécommunications, 1995We consider the construction of group block codes, i.e., subgroups of Gn, the n-fold direct product of a group G. Two concepts are introduced that make this construction similar to that of codes over gf(2). The first concept is that of an indecomposable code. The second is that of a parity-check matrix.
Michele Elia, Ezio Biglieri
openaire +3 more sources
2009
In block truncation coding (BTC), an image is segmented into n x n (typically, 4 x 4) nonoverlapping blocks of pixels, and a two-level (one-bit) quantizer is independently designed for each block. Both the quantizer threshold and the two reconstruction levels are varied in response to the local statistics of a block.
Majid Rabbani, Paul W. Jones
openaire +2 more sources
In block truncation coding (BTC), an image is segmented into n x n (typically, 4 x 4) nonoverlapping blocks of pixels, and a two-level (one-bit) quantizer is independently designed for each block. Both the quantizer threshold and the two reconstruction levels are varied in response to the local statistics of a block.
Majid Rabbani, Paul W. Jones
openaire +2 more sources
1990
Publisher Summary This chapter focuses on block codes. Cyclic codes—an important class of codes—are used in many systems because they are easy to implement. Because a cyclic code is a linear code, it is decoded by making use of the syndrome. The syndrome polynomial is used for decoding cyclic codes instead of the syndrome vector.
openaire +2 more sources
Publisher Summary This chapter focuses on block codes. Cyclic codes—an important class of codes—are used in many systems because they are easy to implement. Because a cyclic code is a linear code, it is decoded by making use of the syndrome. The syndrome polynomial is used for decoding cyclic codes instead of the syndrome vector.
openaire +2 more sources
On variable-length-to-block coding
IEEE Transactions on Information Theory, 1972Variable-length-to-block codes are a generalization of run-length codes. A coding theorem is first proved. When the codes are used to transmit information from fixed-rate sources through fixed-rate noiseless channels, buffer overflow results. The latter phenomenon is an important consideration in the retrieval of compressed data from storage.
Frederick Jelinek, K. Schneider
openaire +2 more sources
Bell System Technical Journal, 1957
From the work of Shannon one knows that it is possible to signal over an error-making binary channel with arbitrarily small probability of error in the delivered information. The effects of errors produced in the channel are to be eliminated, according to Shannon, by using an error correcting code. Shannon's proof that such codes exist does not provide
openaire +2 more sources
From the work of Shannon one knows that it is possible to signal over an error-making binary channel with arbitrarily small probability of error in the delivered information. The effects of errors produced in the channel are to be eliminated, according to Shannon, by using an error correcting code. Shannon's proof that such codes exist does not provide
openaire +2 more sources
2015
This chapter deals with linear block codes covering their fundamental concepts, generator and parity check matrices, error-correcting capabilities, encoding and decoding, and performance analysis.
openaire +2 more sources
This chapter deals with linear block codes covering their fundamental concepts, generator and parity check matrices, error-correcting capabilities, encoding and decoding, and performance analysis.
openaire +2 more sources
IEEE Transactions on Information Theory, 1977
Sliding block codes are an intriguing alternative to the block codes used in the development of classical information theory. The fundamental analytical problem associated with the use of a sliding block code (SBC) for source encoding with respect to a fidelity criterion is that of determining the entropy of the coder output.
J. Lau, T. Berger
openaire +2 more sources
Sliding block codes are an intriguing alternative to the block codes used in the development of classical information theory. The fundamental analytical problem associated with the use of a sliding block code (SBC) for source encoding with respect to a fidelity criterion is that of determining the entropy of the coder output.
J. Lau, T. Berger
openaire +2 more sources
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
On coding for block fading channels
IEEE Transactions on Information Theory, 2000Summary: This work considers the achievable performance for coded systems adapted to a multipath block-fading channel model. This is a particularly useful model for analyzing mobile-radio systems which employ techniques such as slow frequency-hopping under stringent time-delay or bandwidth constraints for slowly time-varying channels.
Pierre A. Humblet, Raymond Knopp
openaire +2 more sources