Design of efficient codes for the AWGN channel based on decomposable binary lattices

By Calabrò Stefano   Campanella Matteo   Garbo Giovanni  

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 17, Iss. 6, 1998-06 ,pp. : 757-764

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Finite maximal solid codes

By Lam N.H.  

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 333-347

Elsevier

Access to resources Recommend Favorite

Almost complete sets

By Ambos-Spies K.   Merkle W.   Reimann J.   Terwijn S.A.  

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 177-194

Elsevier

Access to resources Recommend Favorite

On viewing block codes as finite automata

By Shankar P.   Dasgupta A.   Deshmukh K.   Rajan B.S.  

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1775-1797

Elsevier

Access to resources Recommend Favorite

On maximal codes with a finite interpreting delay

By Guesnet Y.  

Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. : 167-183

Elsevier

Access to resources Recommend Favorite