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

Author： Calabrò Stefano   Campanella Matteo   Garbo Giovanni  

Publisher： Emerald Group Publishing Ltd

ISSN： 0332-1649

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

DECODE TO CHANNEL BINARY BLOCK CODES BASED ON NEURAL NETWORKS AND GENETIC ALGORITHM

By Zheng Yuanjin   Tang Xiaoyan   Tay David B. H.  

Applied Artificial Intelligence, Vol. 15, Iss. 2, 2001-02 ,pp. : 141-159

Taylor & Francis Ltd

Access to resources Recommend Favorite

Efficient hierarchical identity-based signatures from lattices

By Tian Miaomiao   Huang Liusheng   Yang Wei  

International Journal of Electronic Security and Digital Forensics, Vol. 5, Iss. 1, 2013-06 ,pp. : 1-10

Inderscience Publishers

Access to resources Recommend Favorite

Locally complete sets and finite decomposable codes

By Neraud  

Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. : 185-196

Elsevier

Access to resources Recommend Favorite

TAN Classifiers Based on Decomposable Distributions

By Cerquides Jesús  

Machine Learning, Vol. 59, Iss. 3, 2005-06 ,pp. : 323-354

Springer Publishing Company

Access to resources Recommend Favorite

Efficient binary code indexing with pivot based locality sensitive clustering

By Zhang Wei   Gao Ke   Zhang Yongdong   Li Jintao  

Multimedia Tools and Applications, Vol. 69, Iss. 2, 2014-03 ,pp. : 491-512

Springer Publishing Company

Access to resources Recommend Favorite