Abstract
AbstractAn embedding of a code is a mapping that preserves distances between codewords. We prove that any code with code distance and length can be embedded into an maximum distance separable (MDS) code with the same code distance and length but under a larger alphabet. As a corollary we obtain embeddings of systems of partial mutually orthogonal Latin cubes and ‐ary quasigroups.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
