Abstract
We state that the minimum and the maximum support weight of subcodes of a code are useful in several aspects. Based on the above findings, we will determine part of the above mentioned parameters for two classes of binary codes. We also present the separation property and calculate the trellis complexity of a class of binary codes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.