Abstract
We develop a technique for improving the universal linear programming bounds (ULPB) on the cardinality and the minimum distance of codes in infinite projective spaces FPn/sup -1/ (F=R,C,H). We introduce test functions P/sub j/(FP/sup n-1/,/spl rho/) having the property that P/sub j/(FP/sup n-1/,/spl rho/)<0 for some j if and only if the corresponding ULPB can be further improved by linear programming.
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
