Abstract
For a linear code over GF(q) we consider two kinds of “subcodes” called residuals and punctures. When does the collection of residuals or punctures determine the isomorphism class of the code? We call such a code residually or puncture reconstructible. We investigate these notions of reconstruction and show that, for instance, selfdual binary codes are puncture and residually reconstructible. A result akin to the edge reconstruction of graphs with sufficiently many edges shows that a code whose dimension is small in relation to its length is puncture reconstructible. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 285–291, 1998
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.