Good ternary 2-traceability codes exist
G Kabatiansky - International Symposium onInformation Theory …, 2004 - ieeexplore.ieee.org
International Symposium onInformation Theory, 2004. ISIT 2004 …, 2004•ieeexplore.ieee.org
This paper proves that random ternary codes are 2-traceability codes for code rate R/spl
ges/c> 0. This gives an affirmative answer to a particular case of the open problem of the
minimum size q/sub t/of the alphabet over which there exist t-traceability codes with
nonvanishing code rate.
ges/c> 0. This gives an affirmative answer to a particular case of the open problem of the
minimum size q/sub t/of the alphabet over which there exist t-traceability codes with
nonvanishing code rate.
This paper proves that random ternary codes are 2-traceability codes for code rate R/spl ges/c>0. This gives an affirmative answer to a particular case of the open problem of the minimum size q/sub t/ of the alphabet over which there exist t-traceability codes with nonvanishing code rate.
ieeexplore.ieee.org
Showing the best result for this search. See all results