: 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...
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...
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...
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 ...
— 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 ...