A construction of maximum distance profile convolutional codes with small alphabet sizes

Convolutional codes are essential in a wide range of practical applications due to their efficient non-algebraic decoding algorithms. In this paper, we first propose a new family of matrices over finite fields by combining Vandermonde and Moore matrices. Using favourable properties of the matrices i...

Full description

Saved in:
Bibliographic Details
Main Authors: Luo, Gaojun, Cao, Xiwang, Ezerman, Martianus Frederic, Ling, San
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2023
Subjects:
Online Access:https://hdl.handle.net/10356/170716
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-170716
record_format dspace
spelling sg-ntu-dr.10356-1707162024-12-30T15:35:05Z A construction of maximum distance profile convolutional codes with small alphabet sizes Luo, Gaojun Cao, Xiwang Ezerman, Martianus Frederic Ling, San School of Physical and Mathematical Sciences Mathematical Sciences Convolutional code Maximum distance profile Convolutional codes are essential in a wide range of practical applications due to their efficient non-algebraic decoding algorithms. In this paper, we first propose a new family of matrices over finite fields by combining Vandermonde and Moore matrices. Using favourable properties of the matrices in this new family enables us to construct a new family of convolutional codes with memory 1 and maximum distance profile. It is notable that the alphabet sizes of this new family of convolutional codes with maximum distance profile can be kept significantly smaller than those in the literature. Keeping the code rate to a constant, the alphabet size is roughly the square root of the previously best-known value. Nanyang Technological University Submitted/Accepted version The work of Gaojun Luo, Martianus Frederic Ezerman, and San Ling was supported by Nanyang Technological University Research under Grant 04INS000047C230GRT01. The work of Xiwang Cao and Gaojun Luo was supported by the National Natural Science Foundation of China under Grant 12171241. 2023-09-26T08:03:08Z 2023-09-26T08:03:08Z 2023 Journal Article Luo, G., Cao, X., Ezerman, M. F. & Ling, S. (2023). A construction of maximum distance profile convolutional codes with small alphabet sizes. IEEE Transactions On Information Theory, 69(5), 2983-2990. https://dx.doi.org/10.1109/TIT.2023.3236425 0018-9448 https://hdl.handle.net/10356/170716 10.1109/TIT.2023.3236425 2-s2.0-85147285655 5 69 2983 2990 en 04INS000047C230GRT01 IEEE Transactions on Information Theory © 2023 IEEE. All rights reserved. This article may be downloaded for personal use only. Any other use requires prior permission of the copyright holder. The Version of Record is available online at http://doi.org/10.1109/TIT.2023.3236425. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Mathematical Sciences
Convolutional code
Maximum distance profile
spellingShingle Mathematical Sciences
Convolutional code
Maximum distance profile
Luo, Gaojun
Cao, Xiwang
Ezerman, Martianus Frederic
Ling, San
A construction of maximum distance profile convolutional codes with small alphabet sizes
description Convolutional codes are essential in a wide range of practical applications due to their efficient non-algebraic decoding algorithms. In this paper, we first propose a new family of matrices over finite fields by combining Vandermonde and Moore matrices. Using favourable properties of the matrices in this new family enables us to construct a new family of convolutional codes with memory 1 and maximum distance profile. It is notable that the alphabet sizes of this new family of convolutional codes with maximum distance profile can be kept significantly smaller than those in the literature. Keeping the code rate to a constant, the alphabet size is roughly the square root of the previously best-known value.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Luo, Gaojun
Cao, Xiwang
Ezerman, Martianus Frederic
Ling, San
format Article
author Luo, Gaojun
Cao, Xiwang
Ezerman, Martianus Frederic
Ling, San
author_sort Luo, Gaojun
title A construction of maximum distance profile convolutional codes with small alphabet sizes
title_short A construction of maximum distance profile convolutional codes with small alphabet sizes
title_full A construction of maximum distance profile convolutional codes with small alphabet sizes
title_fullStr A construction of maximum distance profile convolutional codes with small alphabet sizes
title_full_unstemmed A construction of maximum distance profile convolutional codes with small alphabet sizes
title_sort construction of maximum distance profile convolutional codes with small alphabet sizes
publishDate 2023
url https://hdl.handle.net/10356/170716
_version_ 1821237128590262272