Results 221 to 230 of about 110,255 (263)
Some of the next articles are maybe not open access.
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 +1 more source
Hybrid block truncation coding
IEEE Signal Processing Letters, 1997A hybrid block truncation coding (BTC) is presented. In the hybrid BTC, a universal codebook using Hamming codes and a differential pulse code modulation (DPCM) are employed, respectively, to the bit plane and the side information of BTC to reduce coding rate.
Chih-Shoung Huang, Yinyi Lin
openaire +1 more source
Enhancement of block-coded speech
ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005This paper describes a very effective method for reducing framing noise associated with block-by-block speech coding algorithms. It is a post-coding speech enhancement procedure designed specifically to combat this type of noise. The procedure is based on a fully adaptive comb filter which is adapted in synchrony with the coding algorithm's frame ...
Dale E. Veeneman, Baruch Mazor
openaire +1 more source
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.
Toby Berger, Joseph Ka-Yin Lau
openaire +1 more source
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.
Toby Berger, Joseph Ka-Yin Lau
openaire +1 more source
Coding in the Block-Erasure Channel
IEEE Transactions on Information Theory, 2006In this correspondence, we study an M-ary block-erasure channel with B blocks, where with probability epsi a block of L coded symbols is erased. The behavior of the error probability of coded systems over such channels is studied, and we show that, if the code is diversity-wise maximum-distance separable, its word error probability is equal to the ...
openaire +1 more source
Noncoherent block coded modulation
2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003., 2004For coherent detection, block coded modulation with multistage decoding is a bandwidth efficient coded modulation system. In this paper, a novel block coded modulation system for noncoherent detection called noncoherent block coded modulation (NBCM) is proposed. We present a theorem for the distance property of the NBCM.
openaire +1 more source
CODING OF BLOCK VECTORS FOR INTRA BLOCK COPY-CODED BLOCKS
2022ZHANG LI +3 more
openaire +3 more sources
Block codes in pomset metric over $${\mathbb {Z}}_m$$
Designs, Codes, and Cryptography, 2023Jinquan Luo, Luo Jinquan
exaly

