On symbol-pair distances of repeated-root constacyclic codes of length $$2p^s$$ over $${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$$ and MDS symbol-pair codes-Reference-Cited by-同舟云学术

On symbol-pair distances of repeated-root constacyclic codes of length $$2p^s$$ over $${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$$ and MDS symbol-pair codes

Published:2021-11-20 Issue: Volume: Page:
ISSN:0938-1279
Container-title:Applicable Algebra in Engineering, Communication and Computing
language:en
Short-container-title:AAECC

Author:

Dinh Hai Q.,Singh Abhay Kumar,Thakur Madhu Kant

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Algebra and Number Theory

Link

https://link.springer.com/content/pdf/10.1007/s00200-021-00534-3.pdf

Reference24 articles.

1. Berman, S.D.: Semisimple cyclic and Abelian codes. II. Kibernetika (Kiev) 3, 21–30 (1967) (Russian). English translation: Cybernetics 3, 17–23 (1967)

2. Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. IEEE Trans. Inf. Theory 57(12), 8011–8020 (2011)

3. Chen, B., Dinh, H.Q., Liu, H., Wang, L.: Constacyclic codes of length $$2p^s$$ over $${\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}$$. Finite Fields Appl. 37, 108–130 (2016)

4. Chen, B., Lin, L., Liu, H.: Constacyclic symbol-pair codes: lower bounds and optimal constructions. IEEE Trans. Inf. Theory 12, 7661–7666 (2017)

5. Chee, Y.M., Ji, L., Kiah, H.M., Wang, C., Yin, J.: Maximum distance separable codes for symbol-pair read channels. IEEE Trans. Inf. Theory 59(11), 7259–7267 (2013)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes;Applicable Algebra in Engineering, Communication and Computing;2023-04-26

2. New Families of MDS Symbol-Pair Codes From Matrix-Product Codes;IEEE Transactions on Information Theory;2023-03

3. Symbol-pair distance of some repeated-root constacyclic codes of length $$p^s$$ over the Galois ring $${{\,\mathrm{GR}\,}}(p^a,m)$$;Applicable Algebra in Engineering, Communication and Computing;2022-03-03