On the performance of affine index assignments for redundancy free source-channel coding

Author

Mehes, András ; Zeger, Kenneth

Author_Institution

Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA

fYear

1995

fDate

28-30 Mar 1995

Firstpage

433

Abstract

Summary form only given. Many popular redundancy free codes are linear or affine, including the natural binary code (NBC), the folded binary code (FBC), the Gray code (GC), and the two´s complement code (TCC). A theorem which considers the channel distortion of a uniform 2 ⁿ level scalar quantizer with stepsize Δ, which uses an affine index assignment with generator matrix G to transmit across a binary symmetric channel with crossover probability q, is given. Using this theorem we compare the NBC and the FBC for any source distribution

Keywords

binary sequences; channel coding; linear codes; source coding; statistical analysis; Gray code; affine codes; affine index assignments; binary symmetric channel; channel distortion; crossover probability; folded binary code; generator matrix; level scalar quantizer; linear codes; natural binary code; performance; redundancy free source-channel coding; source distribution; stepsize; theorem; two´s complement code; Binary codes; Discrete transforms; Hamming weight; Niobium compounds; Reflective binary codes; Symmetric matrices; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 1995. DCC '95. Proceedings

Conference_Location

Snowbird, UT

ISSN

1068-0314

Print_ISBN

0-8186-7012-6

Type

conf

DOI

10.1109/DCC.1995.515543

Filename

515543