Abstract
In this article, a construction of an optimal tight conflict-avoiding code of length 3dpe and weight 3 is shown for d≡1(mod3), e∈N and a prime p≡3(mod8) with p≠3, assuming that p is a non-Wieferich prime if e≥2. This is a new series of optimal conflict-avoiding code for which the number of codewords can be exactly determined.
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.
