Article
Version 1
Preserved in Portico This version is not peer-reviewed
About the Ultimate Efficiency of Interference Binary Codes
Version 1
: Received: 14 October 2021 / Approved: 21 October 2021 / Online: 21 October 2021 (15:08:02 CEST)
How to cite: Adzhemov, A. S.; Albov, N. Y. About the Ultimate Efficiency of Interference Binary Codes. Preprints 2021, 2021100315. https://doi.org/10.20944/preprints202110.0315.v1 Adzhemov, A. S.; Albov, N. Y. About the Ultimate Efficiency of Interference Binary Codes. Preprints 2021, 2021100315. https://doi.org/10.20944/preprints202110.0315.v1
Abstract
The digital representation of various signals allows, at the subsequent stages of their transmission, to apply correction codes that provide protection against possible errors arising from the action of interference in the communication channel. At the same time, it is important that, with the required correcting ability, these codes have the maximum possible speed. The article presents the results of calculations for linear codes, showing their really achievable limiting capabilities.
Keywords
Code construction; minimum code distance; noise immunity; coding efficiency; theoretically achievable boundary; correction codes
Subject
Engineering, Electrical and Electronic Engineering
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment