Algorithm of multidimensional data transmission using extremal uniform hypergraphs
From MaRDI portal
Publication:1995391
Recommendations
- Some graph-based encryption schemes
- Structured encryption algorithm for text cryptography
- Fundamental circuits and cut-sets used in cryptography
- Theoretical and algorithmic foundations of improving the efficiency of packet data transmission in high-speed and secure radio networks
- scientific article; zbMATH DE number 5873073
Cites work
- scientific article; zbMATH DE number 3609723 (Why is no real title available?)
- About realization of integer non-negative numbers tuple into 2-dimensional complexes
- Development of hypergraph theory
- HYPERGRAPHS
- Hypergraph recovery algorithms from a given vector of vertex degrees
- Hypergraphs as algebraic structures
- Minimax under transportation constraints
- Network models with fixed parameters at the communication nodes. I
- Network models with fixed parameters at the communication nodes. II
- Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices
- Primitivity and local primitivity of digraphs and nonnegative matrices
- Reconstructing 2-complexes by a nonnegative integer-valued vector
- Reliable circuits using less reliable relays
Cited in
(3)
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)