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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| 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 |
| Summary: | 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. |
|---|