Cart (Loading....) | Create Account
Close category search window
 

Linear ensembles of codes (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A linear ensemble of codes is defined as one over which the informationK-tupleproptois encoded asproptoG oplus_{z}whereGis equally likely to assume any matrix in a linear spacecal BofKbyNbinary matrices and wherezis independent ofGand equally likely to assume any binaryN-tuple. A technique for upperbounding the ensemble averageP(E)of the probability of error, when the codes ofcal Bare used on the binary symmetric channel with maximum likelihood decoding, is presented which reduces to overbounding a deterministic integer-valued function defined on the space of binaryN-tuples. This technique is applied to the ensemble of K by N binary matrices having for/th row the (i- 1) right cyclic shift of the first, i= 1,2,. . . ,K, and where the first row is equally likely to he any binaryN-tuple. For this ensemble it is shown thatP(E) leq mu(N) exp_{2}-NE_{r}(K/N)whereE_{r}( cdot)is the random coding exponent for the binary symmetric channel and_{ mu}(N)is the number of divisors ofX^{N}+ 1. Ifcal Bis pairwise independent it is shown that the above technique yields the random coding bound for block codes and that moreover there exists at least one code in the ensemblecal Bwhose minimum Hamming distance meets a Gilbert-type lower bound.

Published in:

Information Theory, IEEE Transactions on  (Volume:25 ,  Issue: 4 )

Date of Publication:

Jul 1979

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.