8 search results - page 1 / 2 » A symmetric Roos bound for linear codes |
JCT
2006
13 years 5 months ago
2006
The van Lint-Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of...
TIT
2010
13 years 5 days ago
2010
A message independence property and some new performance upper bounds are derived in this work for erasure, list and decision-feedback schemes with linear block codes transmitted ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract-- We analyze the performance of low-density generator matrix (LDGM) codes for lossy source coding. We first develop a generic technique for deriving lower bounds on the ef...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
TIT
2011
13 years 12 days ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...