loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Systems and Networks Communication (ICSNC'06)
Codes From Generalized Hadamard Matrices
Tahiti, French Polynesia
October 29-November 03
ISBN: 0-7695-2699-3
ASCII Text
x 
 
Xueqin Jiang, MoonHo Lee, Ram Prasad Paudel, TaeChol Shin, "Codes From Generalized Hadamard Matrices," Systems and Networks Communication, International Conference on, pp. 67, International Conference on Systems and Networks Communication (ICSNC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ICSNC.2006.27,
author = {Xueqin Jiang and MoonHo Lee and Ram Prasad Paudel and TaeChol Shin},
title = {Codes From Generalized Hadamard Matrices},
journal ={Systems and Networks Communication, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2699-3},
pages = {67},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICSNC.2006.27},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Systems and Networks Communication, International Conference on
TI - Codes From Generalized Hadamard Matrices
SN - 0-7695-2699-3
SP
EP
A1 - Xueqin Jiang,
A1 - MoonHo Lee,
A1 - Ram Prasad Paudel,
A1 - TaeChol Shin,
PY - 2006
KW - null
VL - 0
JA - Systems and Networks Communication, International Conference on
ER -
 
Xueqin Jiang, Chonbuk National University Jeonju, Korea
MoonHo Lee, Chonbuk National University Jeonju, Korea
Ram Prasad Paudel, Chonbuk National University Jeonju, Korea
TaeChol Shin, Chonbuk National University Jeonju, Korea
The Hadamard Matrices are widely used in communication systems, data compression, error control coding, cryptography, linear filtering and spectral analysis. Such a popularity of Hadamard matrices is explained by their simplicity and efficiency in a variety of concrete practical realizations. In this paper we consider a family {H_m}, m =1,2,.., of generalized Hadamard matrices of order p^m , where p is a prime number, and construct the corresponding family {C^*m} of generalized p-ary Hadamard codes which meet the Plotkin bound.
Citation:
Xueqin Jiang, MoonHo Lee, Ram Prasad Paudel, TaeChol Shin, "Codes From Generalized Hadamard Matrices," icsnc, pp.67, International Conference on Systems and Networks Communication (ICSNC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.