Cover Image

Matroidal Entropy Functions: Constructions, Characterizations and Representations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Qi, Cheng, Minquan, Bai, Baoming
Format:	Preprint
Published:	2023
Subjects:	Information Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four: Part I: Problem Formulation and More
by: Liu, Shaocheng, et al.
Published: (2023)

Intersecting Codes and the Connectivity of $q$-Matroids
by: Conca, Fabrizio, et al.
Published: (2026)

The Cloud and Flock Polynomials of q-Matroids
by: Gluesing-Luerssen, Heide, et al.
Published: (2025)

Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four: Part II: Information Theoretic Constraints Breed New Combinatorial Structures
by: Liu, Shaocheng, et al.
Published: (2025)

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
by: Brakensiek, Joshua, et al.
Published: (2025)

Polynomial Invariants of q-Matroids and Rank-Metric Codes
by: Gluesing-Luerssen, Heide, et al.
Published: (2025)

On Zero-Error Capacity of Graphs with One Edge
by: Cao, Qi, et al.
Published: (2024)

Entropy of Exchangeable Random Graphs
by: Skeja, Anda, et al.
Published: (2023)

Representation of Symmetric Shift Registers
by: Søreng, Jan
Published: (2025)

Geometry of Rényi Entropy on the Majorization Lattice
by: Yadav, Anuj Kumar, et al.
Published: (2026)

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
by: Liu, Hengfeng, et al.
Published: (2025)

Entropy Functions on Two-Dimensional Faces of Polymatroid Region with One Extreme Ray Containing Rank-One Matroid
by: He, Kaizhe, et al.
Published: (2026)

Counterexamples, Constructions, and Nonexistence Results for Optimal Ternary Cyclic Codes
by: Bao, Jingjun, et al.
Published: (2026)

Explicit Entropic Constructions for Coverage, Facility Location, and Graph Cuts
by: Iyer, Rishabh
Published: (2026)

Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Explicit Constructions for Rack-Aware Minimum Storage Partially Cooperative Regenerating Codes
by: Zhao, Hengming, et al.
Published: (2025)

Construction of CCC and ZCCS Through Additive Characters Over Galois Field
by: Ghosh, Gobinda, et al.
Published: (2024)

A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
by: Schaller, Michael, et al.
Published: (2025)

The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice
by: Bruno, Roberto, et al.
Published: (2026)

Universal Costas Matrices: Towards a General Framework for Costas Array Construction
by: Gulec, Fatih, et al.
Published: (2026)

Constructing rotatable permutations of $\mathbb{F}_{2^m}^3$ with $3$-homogeneous functions
by: Chi, Yunwen, et al.
Published: (2024)

Hyper-Minrank: A Unified Hypergraph Characterization of Multi-Sender Index Coding
by: Khalesi, Ali, et al.
Published: (2025)

On the Construction of Recursively Differentiable Quasigroups and an Example of a Recursive $[4,2,3]_{26}$-Code
by: Klimov, Petr
Published: (2026)

On the cross-correlation properties of large-size families of Costas arrays
by: Liu, Runfeng, et al.
Published: (2025)

A Further Investigation on Complete Complementary Codes from $q$-ary Functions
by: Sarkar, Palash, et al.
Published: (2024)

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
by: Guo, Zeyu, et al.
Published: (2026)

PDA Construction via Union of Cartesian Product Cache Configurations for Coded Caching
by: Wang, Jinyu, et al.
Published: (2025)

When can an expander code correct $Ω(n)$ errors in $O(n)$ time?
by: Cheng, Kuan, et al.
Published: (2023)

A New Construction Structure on MISO Coded Caching with Linear Subpacketization: Half-Sum Disjoint Packing
by: Zheng, Bowen, et al.
Published: (2026)

A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing
by: Cheng, Minquan, et al.
Published: (2025)

A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Latin Rectangle
by: Yang, Yongcheng, et al.
Published: (2026)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
by: Gabrić, Daniel, et al.
Published: (2024)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
by: Mizunuma, Yuto, et al.
Published: (2026)

New Correlation Bound and Construction of Quasi-Complementary Code Sets
by: Sarkar, Palash, et al.
Published: (2022)

Construction of Simultaneously Good Polar Codes and Polar Lattices
by: Liu, Ling, et al.
Published: (2025)

A New Construction Structure on Multi-access Coded Caching with Linear Subpacketization: Cyclic Multi-Access Non-Half-Sum Disjoint Packing
by: Li, Mengyuan, et al.
Published: (2026)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
by: Chen, Yeyuan, et al.
Published: (2024)

Optimizing Extension Techniques for Discovering Non-Algebraic Matroids
by: Bamiloshin, Michael, et al.
Published: (2024)

On Polar Coding with Feedback
by: Liu, Ling, et al.
Published: (2026)

Generalized Orthogonal de Bruijn and Kautz Sequences
by: Chen, Yuan-Pon, et al.
Published: (2025)