Abstract
We consider some of the codes generated due to the AUNU patterns as studied earlier by the authors (the [5 3 2] linear code, [7 4 2]-linear code and the [14 8 3] codes) . The Parity check matrices of these codes are obtained and used in constructing their Tanner graphs. A Tanner graph has n variable nodes, corresponding to the code bits of the codeword, and m check nodes that represents the parity check equations. An assignment of the code bits of a received vector is now known to be a valid code word if all the parity check equations from the Tanner graph are satisfied otherwise, an error is detected. Moreover, other code properties such as the regularity or otherwise of these codes are also determined from such Tanner graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
