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

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/sup n/ level scalar quantizer with stepsize /spl Delta/, 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.