Algorithm of multidimensional data transmission using extremal uniform hypergraphs

DOI10.1134/S1064230721010056zbMATH Open1459.94003OpenAlexW3132307238MaRDI QIDQ1995391FDOQ1995391

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

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

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

Cites Work

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

Cited In (3)

• First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees
• Transmitting in the \(n\)-dimensional cube
• Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1995391)