Results 181 to 190 of about 1,184,577 (219)
Some of the next articles are maybe not open access.
IEEE Information Theory Workshop, 2005., 2005
A polyalphabetic (or mixed) block code is a set of codewords of finite length, where every symbol of a codeword belongs to its own alphabet. In contrast to previous publications we consider a general case, where we do not assume any algebraic structure of the alphabets and the codes.
Vladimir Sidorenko +4 more
openaire +1 more source
A polyalphabetic (or mixed) block code is a set of codewords of finite length, where every symbol of a codeword belongs to its own alphabet. In contrast to previous publications we consider a general case, where we do not assume any algebraic structure of the alphabets and the codes.
Vladimir Sidorenko +4 more
openaire +1 more source
IEEE Transactions on Information Theory, 2009
A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander ...
Alberto Jiménez Feltström +3 more
openaire +1 more source
A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander ...
Alberto Jiménez Feltström +3 more
openaire +1 more source
Block and sliding-block source coding
IEEE Transactions on Information Theory, 1977A new form of source coding subject to a fidelity criterion, called sliding-block coding, has recently been introduced by Gray, Neuhoff, and Ornstein. A method of conversion from block coding to sliding-block coding, or vice versa, with an arbitrarily small increase in rate is shown for ergodic sources.
Paul C. Shields, David L. Neuhoff
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 +1 more source
Extension of source coding theorems for block codes to sliding-block codes
IEEE Transactions on Information Theory, 1980For arbitrary alphabets and single-letter fidelity criteria, two theorems are given which allow any fixed-rate or variable-rate source coding theorem for block codes to be extended to sliding-block codes. Applications are given to universal coding and to the coding of a stationary nonergodic source.
openaire +1 more source
Improved Code Shortening for Block and Product Codes
2006 IEEE 63rd Vehicular Technology Conference, 2006Code shortening is commonly performed in practice but its analytical decoding performance is not well understood. In this letter, we present tight bounds for estimating the weight enumerator and hence BER (bit error rate) performance of linear shortened and shortened-extended block/product codes operating in AWGN and Rayleigh fading channels.
Kai Ching Lim, Yong Liang Guan 0001
openaire +1 more source
A Queued-Code Based on LDPC Block Codes
IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference, 2007A 'queued-code' is a novel code which allows for instantaneous rate adaptation, to match the current channel state information (CSI), assumed known to the transmitter. Previously, information theoretic codes were analyzed in the regime of large delay bounds.
Satashu Goel, Rohit Negi
openaire +1 more source
On the code distance of a woven block code construction
2017 IEEE International Symposium on Information Theory (ISIT), 2017In this paper we propose a woven block code construction based on two convolutional outer codes and a single inner code. We proved lower and upper bounds on this construction's code distance. The lower bound is shown to be higher than the product of the free distances of inner and outer constituent codes.
Igor V. Zhilin +2 more
openaire +1 more source
Speech coding using efficient block codes
ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005Digital coders invariably introduce errors into analog signals such as speech. The importance of adjusting the spectrum of the error so as to minimize the subjective distortion is now well recognized. The optimum noise spectrum for minimum subjective distortion is in general non-flat.
Manfred R. Schroeder, Bishnu S. Atal
openaire +1 more source
On the Coding Gain of Linear Binary Block Codes
IEEE Transactions on Communications, 1984The coding gain of linear binary block codes on the AWGN channel is studied. Antipodal signaling and hard decision demodulation are assumed. Simple asymptotic expressions for the gain at high and low energy to noise spectral density ratios are derived. Monotonicity of the coding gain is also discussed.
Vladan M. Jovanovic, Srdjan Z. Budisin
openaire +1 more source