The Sizes of Optimal q -Ary Codes of Weight Three and Distance Four: A Complete Solution

This correspondence introduces two new constructive techniques to complete the determination of the sizes of optimal q-ary codes of constant weight three and distance four.

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 54; no. 3; pp. 1291 - 1295
Main Authors:	Yeow Meng Chee, Son Hoang Dau, Ling, A.C.H., San Ling
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01-03-2008 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Applied sciences Australia Coding, codes Communication system control Constant-weight codes Electronics Encoding Exact sciences and technology Information theory Information, signal and communications theory large sets with holes Multicast algorithms Network coding Optimization Parallel processing Routing Sequences Signal and communications theory Studies Telecommunications and information theory Unicast Optimal code Constant-weight codes sequences large sets with holes
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	This correspondence introduces two new constructive techniques to complete the determination of the sizes of optimal q-ary codes of constant weight three and distance four.
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2007.915885