Abstract
Quasi-uniform random vectors have probability distributions that are uniform over their projections. They are of fundamental interest because a linear information inequality is valid if and only if it is satisfied by all quasi-uniform random vectors. In this paper, we investigate properties of codes induced by quasi-uniform random vectors. We prove that quasi-uniform codes (which include linear and almost affine codes as special cases) are distance-invariant and that Greene's Theorem and the Critical Theorem of Crapo and Rota hold in the setting of quasi-uniform codes. We show that both theorems are essentially combinatorial but not algebraical in nature. Linear programming bounds proposed by Delsarte are extended for quasi-uniform codes.
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.
