Results 121 to 130 of about 235,653 (168)
Some of the next articles are maybe not open access.
2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE), 2010
This paper, studies the comparative performance of a traditional and Concatenated coding schemes for transmission of digital data over a mobile communication channel. Traditional codes are effective for reliable transmission of information over hostile channel when the errors caused by the channel are statistically independent.
Yousef Hwegi, Nasser Ali, Mahmod Osman
openaire +1 more source
This paper, studies the comparative performance of a traditional and Concatenated coding schemes for transmission of digital data over a mobile communication channel. Traditional codes are effective for reliable transmission of information over hostile channel when the errors caused by the channel are statistically independent.
Yousef Hwegi, Nasser Ali, Mahmod Osman
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 Feltstrom +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 Feltstrom +3 more
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
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 +1 more source
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 +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.
Shields, Paul C., Neuhoff, David L.
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,
null Yun Xie, null Guo-Qiang Han
openaire +1 more source
Woven codes with outer block codes
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2002Woven codes with outer binary block codes and additional permutation are presented. This enables the construction of a new class of woven block codes, where the minimum distance is about twice the product of the minimum distances of the component codes.
J. Freudenberger +3 more
openaire +1 more source
2020
As usual, in this chapter we consider that p denotes a prime number, q is a prime power and \({\mathbb F}_{q}\) is the finite field with q elements. We begin by defining the general concept of a code over \({\mathbb F}_{q}\); after this, we present the concept of a linear code that is the more important class of codes in coding and information theory ...
openaire +1 more source
As usual, in this chapter we consider that p denotes a prime number, q is a prime power and \({\mathbb F}_{q}\) is the finite field with q elements. We begin by defining the general concept of a code over \({\mathbb F}_{q}\); after this, we present the concept of a linear code that is the more important class of codes in coding and information theory ...
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.
M. Schroeder, B. Atal
openaire +1 more source
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.
Irving S. Reed, Xuemin Chen
openaire +1 more source
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.
Irving S. Reed, Xuemin Chen
openaire +1 more source