Algorithm of multidimensional data transmission using extremal uniform hypergraphs

DOI10.1134/S1064230721010056zbMath1459.94003OpenAlexW3132307238MaRDI QIDQ1995391

A. V. Mokryakov, E. K. Egorova, A. A. Suvorova, Vladimir I. Tsurkov

Publication date: 23 February 2021

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230721010056

zbMATH Keywords

transferring of confidential data

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Communication theory (94A05)

Related Items (1)

First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees

Cites Work

• Hypergraphs as algebraic structures
• Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices
• Minimax under transportation constraints
• Development of hypergraph theory
• Network models with fixed parameters at the communication nodes. II
• Network models with fixed parameters at the communication nodes. I
• Hypergraph recovery algorithms from a given vector of vertex degrees
• Reconstructing 2-complexes by a nonnegative integer-valued vector
• HYPERGRAPHS
• Primitivity and Local Primitivity of Digraphs and Nonnegative Matrices
• Reliable circuits using less reliable relays
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithm of multidimensional data transmission using extremal uniform hypergraphs