Proceedings of the 2014 International Conference on Future Computer and Communication Engineering

<Previous Article In Volume
Next Article In Volume>

Weight Distributions of Divisible Codes Meeting the Griesmer Bound over F5 with Dimension 3

Authors
Fangchi Liang, Yuena Ma, Tao Ku
Corresponding Author
Fangchi Liang
Available Online March 2014.
DOI
10.2991/icfcce-14.2014.36How to use a DOI?
Keywords
Divisible code, Optimal code, Weight Polynomial
Abstract

Based on a relationship between generator matrix of given code and its weight distribution, all [31s+t, 3] 5(t=7, 13, 19, 25) optimal divisible codes with divisor 5 are determined by solving systems of linear equations. Then their generator matrices and weight polynomials of these optimal divisible codes are also given.

Copyright
© 2014, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 2014 International Conference on Future Computer and Communication Engineering
Series
Advances in Intelligent Systems Research
Publication Date
March 2014
ISBN
978-94-6252-005-9
ISSN
1951-6851
DOI
10.2991/icfcce-14.2014.36How to use a DOI?
Copyright
© 2014, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

risenwbib
TY  - CONF
AU  - Fangchi Liang
AU  - Yuena Ma
AU  - Tao Ku
PY  - 2014/03
DA  - 2014/03
TI  - Weight Distributions of Divisible Codes Meeting the Griesmer Bound over F5 with Dimension 3
BT  - Proceedings of the 2014 International Conference on Future Computer and Communication Engineering
PB  - Atlantis Press
SP  - 146
EP  - 148
SN  - 1951-6851
UR  - https://doi.org/10.2991/icfcce-14.2014.36
DO  - 10.2991/icfcce-14.2014.36
ID  - Liang2014/03
ER  -