About convexity of one function from coding theory | IEEE Conference Publication | IEEE Xplore

About convexity of one function from coding theory


Abstract:

We complete the proof of upper bound for the multiple packing of q-ary Hamming space.

Abstract:

We complete the proof of upper bound for the multiple packing of q-ary Hamming space.
Date of Conference: 06-11 July 2008
Date Added to IEEE Xplore: 08 August 2008
ISBN Information:

ISSN Information:

Conference Location: Toronto, ON, Canada

References

References is not available for this document.