Abstract
Abstract Database motivations lead to the concept of SPT(q, k, n)-codes. These are q-ary codes of length n, minimum distance n − k + 1 and have the property that for any possible k − 1 coordinate positions there are two codewords that agree exactly there. We derive upper and lower bounds on the length of the code as function of q and k. The upper bounds use geometric arguments and bounds on spherical codes, the lower bounds are probabilistic.
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.
