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

Simple item page
dc.creatorChee, Yeow Meng
dc.creatorDau, Son Hoang
dc.creatorLing, Alan C. H.
dc.creatorLing, San
dc.date2008-03-26
dc.date.accessioned2026-07-07T09:28:23Z
dc.date.available2026-07-07T09:28:23Z
dc.descriptionThis 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.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/0803.3658
dc.identifierhttp://arxiv.org/abs/0803.3658
dc.identifierIEEE Transactions on Information Theory, vol. 54, no. 3, pp. 1291-1295, 2008
dc.identifierdoi:10.1109/TIT.2007.915885
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157437
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.titleThe Sizes of Optimal q-Ary Codes of Weight Three and Distance Four: A Complete Solution
dc.typetext

Files

Collections

arXiv