On the Hamming Distances of Constacyclic Codes of Length 5<i>p<sup>S</sup> </i>

IEEE Access - Tập 8 - Trang 46242-46254 - 2020
Hai Q. Dinh1,2, Xiaoqiang Wang3, Jirakom Sirisrisakulchai4
1Division of Computational Mathematics and Engineering, Institute for Computational Science, Ton Duc Thang University, Ho Chi Minh City, Vietnam
2Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam
3Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan, China
4Centre of Excellence in Econometrics, Faculty of Economics, Chiang Mai University, Chiang Mai, Thailand

Tóm tắt

Từ khóa


Tài liệu tham khảo

10.1090/conm/609/12150

10.1090/conm/480/09369

dinh, 0, Hamming distances of constacyclic codes of length $3p^{s}$ and optimal codes with respect to the Griesmer and Singleton bounds

10.1016/j.disc.2019.01.023

10.1017/CBO9780511807077

10.1016/j.ffa.2016.08.005

lidl, 2008, Finite Fields

10.1016/j.ffa.2012.10.002

macwilliams, 1998, The Theory of Error-Correcting Codes

10.1109/TIT.1973.1054936

10.1016/j.ffa.2014.11.006

10.1016/j.dam.2014.05.046

10.1016/j.ffa.2007.07.001

10.1090/conm/642/12886

10.1016/j.disc.2013.01.024

10.1016/j.ffa.2011.07.003

10.1109/18.75249

10.1016/j.ffa.2011.09.005

10.1142/S1793557113500204

özadam, 2009, The minimum Hamming distance of cyclic codes of length $2p^{s}$, Appl Algebra Engrg Commun Comput, 5527, 92

10.1016/j.ffa.2016.04.001

pless, 1998, Handbook of Coding Theory

10.1109/18.75250

10.1109/18.556131

Thông tin
Thông tin xuất bản

IEEE Access

Tập 8

46242-46254

Thông tin tác giả