Abstract
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> This paper introduces a new combinatorial construction for <emphasis><formula formulatype="inline"><tex>$q$</tex></formula></emphasis>-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between <emphasis><formula formulatype="inline"><tex>$q$</tex></formula></emphasis>-ary constant-weight codes and sets of pairwise disjoint combinatorial designs of various types. </para>
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
