创源大讲堂—q-ary cyclic constant-weight codes
摘要:Acyclic(n,d,w)qcodeisaq-arycycliccodeoflengthn,minimumHammingdistancedandweightw.LetCAq(n,d,w)denotethelargestpossiblenumberofcodewordsinacyclic(n,d,w)qcode.Acyclic(n,d,w)qcodeissaidtobeoptimalifitcontainsCAq(n,d,w)codewords.Inthistalkwegiveseveralconstructionsofoptimalcyclic(n,d,w)qcodebydifferencemethods.WealsomentionthattheexactvalueofCAq(n,d,w)aredeterminedforsomespecificparameters.报...