1579 search results - page 75 / 316 » On the Constructions of Constant-Weight Codes |
SAS
1999
Springer
15 years 2 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
IEEEPACT
2002
IEEE
15 years 2 months ago
2002
IEEE
Optimizations performed at link time or directly applied to final program executables have received increased attention in recent years. Such low-level optimizations can benefit...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probabil...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
— Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, ...
SIAMDM
2010
14 years 8 months ago
2010
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in Rn . We show that the minimum distance is multipli...