New linear binary block codes for the AWGN channel Conference Paper

abstract

• We study the design of linear binary block codes exhibiting large minimum distance, i.e. suitable for the AWGN channel. It is first shown that the n columns of length 2 k of any (n, k) linear, binary block code, are also columns of a linear 2 k Hadamard matrix. Based on this observation, we develop nested search methods to obtain linear binary block codes of almost any practical rate having large minimum distance. The codes compare favorably with upper and lower bounds on the minimum distance, as well as to existing codes. 2004 IEEE.

name of conference

• Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.

authors

• Georghiades, Costas

published proceedings

• CONFERENCE RECORD OF THE THIRTY-EIGHTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1 AND 2

author list (cited authors)

• Papadimitriou, P. D., & Georghiades, C. N.

citation count

• 1

complete list of authors

• Papadimitriou, PD||Georghiades, CN

publication date

• January 2004

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Conference record / Asilomar Conference on Signals, Systems & Computers. Asilomar Conference on Signals, Systems & Computers  Journal

Digital Object Identifier (DOI)

• 10.1109/acssc.2004.1399315

International Standard Book Number (ISBN) 10

• 0-7803-8622-1

start page

• 1120

end page

• 1125

volume

• 1

URL

• http://dx.doi.org/10.1109/acssc.2004.1399315