New Upper Bound for $(m, k, \lambda )$-IRSs With $\lambda \geq 2$
Lists
Only you see this
Abstract
Impulse radio sequences were first introduced by Chu and Colbourn in 2004. A better upper bound for <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(m</i> , <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> , 1)-IRS was given by Gao and Chang in 2006. In this paper, we present an upper bound for <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(m</i> , <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> , lambda)-IRS with <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">lambda</i> <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ges</i> <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</i> , which improves the known Johnson bound.
BibTeX
@article{chang2009new,
author = {Yanxun Chang and Xiao Wang},
title = {{New Upper Bound for $(m, k, \textbackslash\{\}lambda )$-IRSs With $\textbackslash\{\}lambda \textbackslash\{\}geq 2$}},
journal = {IEEE Transactions on Information Theory},
year = {2009},
doi = {10.1109/tit.2009.2025579},
}Loading related content...