Sciweavers

215 search results - page 3 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
JGT
2010
103views more  JGT 2010»
14 years 8 months ago
Characterizing 3-connected planar graphs and graphic matroids
: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...
Manoel Lemos, Talmage James Reid, Haidong Wu
71
Voted
CORR
2004
Springer
115views Education» more  CORR 2004»
14 years 9 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
DAM
2006
69views more  DAM 2006»
14 years 9 months ago
On the binary projective codes with dimension 6
All binary projective codes of dimension up to 6 are classified. Information about the number of the codes with different minimum distances and different orders of automorphism gro...
Iliya Bouyukliev
DCC
1999
IEEE
15 years 1 months ago
Performance of Quantizers on Noisy Channels Using Structured Families of Codes
Abstract--Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for ...
András Méhes, Kenneth Zeger
ICC
2007
IEEE
144views Communications» more  ICC 2007»
15 years 3 months ago
Binary Repetition Codes and SPC Product Codes for Coded and Cooperative Diversity Systems
— A three stage network protocol that can achieve coded and cooperative diversity to improve network coverage is investigated. In Stage 1, a cyclic redundancy check code is used ...
Pavel Loskot, Norman C. Beaulieu