Vector Multispaces and Multispace Codes
Abstract: Basic algebraic and combinatorial properties of finite vector spaces in which individual vectors are allowed to have multiplicities larger than $ 1 $ are derived. An application in coding theory is illustrated by showing that multispace codes that are introduced here may be used in random linear network coding scenarios, and that they generalize standard subspace codes (defined in the set of all subspaces of $ \mathbb{F}_qn $) and extend them to an infinitely larger set of parameters. In particular, in contrast to subspace codes, multispace codes of arbitrarily large cardinality and minimum distance exist for any fixed $ n $ and $ q $.
- T. Etzion and A. Vardy, “Error-Correcting Codes in Projective Space,” IEEE Trans. Inform. Theory 57(2) (2011), 1165–1173.
- T. Ho, M. Médard, R. Kötter, D. Karger, M. Effros, J. Shi, and B. Leong, “A Random Linear Network Coding Approach to Multicast,” IEEE Trans. Inform. Theory, 52(10) (2006), 4413–4430.
- A. Kendziorra and S. E. Schmidt, “Network Coding with Modular Lattices,” J. Algebra Appl. 10(6) (2011), 1319–1342.
- R. Kötter and F. R. Kschischang, “Coding for Errors and Erasures in Random Network Coding,” IEEE Trans. Inform. Theory 54(8) (2008), 3579–3591.
- H. Wang, C. Xing, and R. Safavi-Naini, “Linear Authentication Codes: Bounds and Constructions,” IEEE Trans. Inform. Theory 49(4) (2003), 866–872.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.