AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (299.3 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Ultimate linear block and convolutional codes

University of Galway (previously National University of Ireland Galway), Ireland
Show Author Information

Abstract

Linear block and convolutional codes are designed using unit schemes and families of these to required length, rate, distance and type are mined. Properties, such as type and distance, of the codes follow from the types of units used and thus required codes are built from specific units. Orthogonal units, units in group rings, Fourier/Vandermonde units and related units are used to construct and analyse linear block and convolutional codes and to construct these to predefined length, rate, distance and type. Series of self-dual, dual containing, quantum error-correcting and linear complementary dual codes are constructed for both linear block and convolutional codes. Low density parity check linear block and linear convolutional codes are constructed from unit schemes.

CLC number: 15B99, 94B05, 94B10

References

【1】
【1】
 
 
AIMS Mathematics
Pages 8398-8421

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Hurley T. Ultimate linear block and convolutional codes. AIMS Mathematics, 2025, 10(4): 8398-8421. https://doi.org/10.3934/math.2025387

4

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 02 December 2024
Revised: 20 March 2025
Accepted: 24 March 2025
Published: 15 April 2025
©2025 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)