Results 251 to 260 of about 241,559 (311)
Some of the next articles are maybe not open access.
Information Processing Letters, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gilad Baruch +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gilad Baruch +2 more
openaire +1 more source
IEEE Potentials, 2001
The article discusses systematic cyclic linear block codes. A block code uses an encoder that accepts a block of message symbols, and generates a block of code word symbols at the output. This type is in contrast to a convolutional code when the encoder accepts a continuous stream of symbols and similarly generates a continuous encoded output stream. A
L. Litwin, K. Ramaswamy
openaire +1 more source
The article discusses systematic cyclic linear block codes. A block code uses an encoder that accepts a block of message symbols, and generates a block of code word symbols at the output. This type is in contrast to a convolutional code when the encoder accepts a continuous stream of symbols and similarly generates a continuous encoded output stream. A
L. Litwin, K. Ramaswamy
openaire +1 more source
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