:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Gulec, Fatih, Abolghasemi, Vahid
Format:	Preprint
Published:	2026
Subjects:	Information Theory Combinatorics
Online Access:	https://arxiv.org/abs/2602.03407
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Double-Cover-Based Analysis of the Bethe Permanent of Block-Structured Positive Matrices
by: Wu, Binghong, 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)

Matroidal Entropy Functions: Constructions, Characterizations and Representations
by: Chen, Qi, et al.
Published: (2023)

On the Construction of Recursively Differentiable Quasigroups and an Example of a Recursive $[4,2,3]_{26}$-Code
by: Klimov, Petr
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)

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)

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

Optimal Repair Bandwidth and Repair I/O of $(n,n-2,2)$ MDS Array Codes
by: Wu, Huawei
Published: (2026)

Planar Matrices and Arrays of Feynman Diagrams
by: Cachazo, Freddy, et al.
Published: (2019)

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

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

Generalized graph codes and thier minimum distances
by: Fujii, Naoki
Published: (2025)

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

Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems
by: Jakhar, Gunank, et al.
Published: (2026)

The Closure of LCD-to-GI Reductions via Generalized Inner Products
by: Ishizuka, Keita
Published: (2026)

A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble
by: Guruswami, Venkatesan, et al.
Published: (2023)

On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
by: Yu, Wenjun, et al.
Published: (2025)

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

Towards a conjecture on a special class of matrices over commutative rings of characteristic 2
by: Wu, Baofeng
Published: (2021)

Universal cycle constructions for k-subsets and k-multisets
by: Campbell, Colin, et al.
Published: (2026)

On a recent extension of a family of biprojective APN functions
by: Kölsch, Lukas
Published: (2024)

Construction of extremal Type II $\mathbb{Z}_{8}$-codes via doubling method
by: Ban, Sara, et al.
Published: (2024)

On a conjecture on APN permutations
by: Bartoli, Daniele, et al.
Published: (2021)

New upper bounds on binary linear codes and a $\mathbb Z_4$-code with a better-than-linear Gray image
by: Kiermaier, Michael, et al.
Published: (2015)

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, et al.
Published: (2024)

Decoding Trombetti-Zhou codes: a new syndrome-based decoding approach
by: Li, Chunlei, et al.
Published: (2025)

Constructing MRD codes by switching
by: Shi, Minjia, et al.
Published: (2022)

Planar Matrices and Arrays of Feynman Diagrams: Poles for Higher $k$
by: Guevara, Alfredo, et al.
Published: (2020)

Efficient encoding and decoding algorithm for a class of perfect single-deletion-correcting permutation codes
by: Gao, Minhan, et al.
Published: (2024)

Degree-$M$ Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-negative Matrix
by: Huang, Yuwen, et al.
Published: (2023)

An example showing that Schrijver's $\vartheta$-function need not upper bound the Shannon capacity of a graph
by: Sason, Igal
Published: (2025)

On the cross-correlation of Golomb Costas permutations
by: Liu, Huaning, et al.
Published: (2024)

Explicit determination of a class of permutation rational functions in any characteristic
by: Li, Yi, et al.
Published: (2026)

Generalized Three and Four Person Hat Game
by: van Uem, Theo
Published: (2017)

Batch Array Codes
by: Kong, Xiangliang, et al.
Published: (2024)