Corpus ID: 210164690

On the Gap between Scalar and Vector Solutions of Generalized Combination Networks

@article{Liu2020OnTG,
  title={On the Gap between Scalar and Vector Solutions of Generalized Combination Networks},
  author={Hedongliang Liu and Hengjia Wei and Sven Puchinger and Antonia Wachter-Zeh and Moshe Schwartz},
  journal={ArXiv},
  year={2020},
  volume={abs/2006.04870}
}
  • Hedongliang Liu, Hengjia Wei, +2 authors Moshe Schwartz
  • Published 2020
  • Computer Science, Mathematics
  • ArXiv
  • We study scalar-linear and vector-linear solutions to the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters. These bounds improve and extend the parameter range of known bounds. Using these new bounds we present a general lower bound on the gap in the alphabet size between scalar-linear and vector-linear solutions. 

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 38 REFERENCES

    Network Coding Solutions for the Combination Network and its Subgraphs

    VIEW 5 EXCERPTS

    On Vector Linear Solvability of Multicast Networks

    VIEW 1 EXCERPT

    On the Message Dimensions of Vector Linearly Solvable Networks

    VIEW 1 EXCERPT

    On the Hardness of Approximating the Network Coding Capacity

    VIEW 1 EXCERPT

    Vector network coding based on subspace codes outperforms scalar linear network coding

    VIEW 5 EXCERPTS

    Vector network coding algorithms

    VIEW 1 EXCERPT

    Algebraic Algorithms for Vector Network Coding

    VIEW 1 EXCERPT

    Grassmannian Codes with New Distance Measures for Network Coding

    • Tuvi Etzion, Hui Bin Zhang
    • Computer Science, Mathematics
    • 2018 IEEE International Symposium on Information Theory (ISIT)
    • 2018
    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL