Optimal ternary constant-composition codes with weight four and distance six

Hengjia Wei; Hui Zhang; Mingzhi Zhu; Gennian Ge

doi:10.1016/j.disc.2014.10.015

Optimal ternary constant-composition codes with weight four and distance six

Hengjia Wei, Hui Zhang, Mingzhi Zhu, Gennian Ge

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal ternary constant-composition codes with Hamming weight four and minimum distance six. The problem is solved with a small number of lengths undetermined. The previously known results are those with code length no greater than 10.

Original language	English
Pages (from-to)	72-87
Number of pages	16
Journal	Discrete Mathematics
Volume	338
Issue number	3
DOIs	https://doi.org/10.1016/j.disc.2014.10.015
State	Published - 6 Mar 2015
Externally published	Yes

Keywords

Constant-composition codes
Group divisible codes
Ternary codes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2014.10.015

Cite this

@article{e2479c6757eb4e0d8a2eb828a97ae722,

title = "Optimal ternary constant-composition codes with weight four and distance six",

abstract = "The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal ternary constant-composition codes with Hamming weight four and minimum distance six. The problem is solved with a small number of lengths undetermined. The previously known results are those with code length no greater than 10.",

keywords = "Constant-composition codes, Group divisible codes, Ternary codes",

author = "Hengjia Wei and Hui Zhang and Mingzhi Zhu and Gennian Ge",

note = "Publisher Copyright: {\textcopyright} 2014 Elsevier B.V.",

year = "2015",

month = mar,

day = "6",

doi = "10.1016/j.disc.2014.10.015",

language = "English",

volume = "338",

pages = "72--87",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Optimal ternary constant-composition codes with weight four and distance six

AU - Wei, Hengjia

AU - Zhang, Hui

AU - Zhu, Mingzhi

AU - Ge, Gennian

PY - 2015/3/6

Y1 - 2015/3/6

N2 - The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal ternary constant-composition codes with Hamming weight four and minimum distance six. The problem is solved with a small number of lengths undetermined. The previously known results are those with code length no greater than 10.

AB - The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal ternary constant-composition codes with Hamming weight four and minimum distance six. The problem is solved with a small number of lengths undetermined. The previously known results are those with code length no greater than 10.

KW - Constant-composition codes

KW - Group divisible codes

KW - Ternary codes

UR - http://www.scopus.com/inward/record.url?scp=84913556401&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2014.10.015

DO - 10.1016/j.disc.2014.10.015

M3 - Article

AN - SCOPUS:84913556401

SN - 0012-365X

VL - 338

SP - 72

EP - 87

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 3

ER -

Optimal ternary constant-composition codes with weight four and distance six

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this