Abstract
Constant-composition codes are a special type of constant-weight codes and have attracted recent interest due to their numerous applications. In a recent work, the authors found that an optimal (n, 5, [2, 1, 1])4-code of constant-composition can be obtained from a Room square of side n with super-simple property. In this paper, we study the existence problem of super-simple Room squares. The problem is solved leaving only two minimal possible n undetermined.
Sign-in/Register to access full text options 
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.
