Cover Image

Improved Upper Bound for the Size of a Trifferent Code

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bhandari, Siddharth, Khetan, Abhishek
Format:	Preprint
Published:	2024
Subjects:	Information Theory Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Vector Trifference
by: Bhandari, Siddharth, et al.
Published: (2025)

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
by: Goyal, Keshav, et al.
Published: (2024)

Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
by: Goyal, Keshav, et al.
Published: (2024)

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

Permutation and Multi-permutation Codes Correcting Multiple Deletions
by: Wang, Shuche, et al.
Published: (2024)

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

Automated Discovery of Improved Constant Weight Binary Codes
by: Rosin, Christopher D.
Published: (2026)

Improved Constructions of Skew-Tolerant Gray Codes
by: Himelfarb, Gabriel Sac, et al.
Published: (2024)

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

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

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

Threshold rates for properties of random codes
by: Guruswami, Venkatesan, et al.
Published: (2020)

The Labeled Coupon Collector Problem
by: Tan, Andrew, et al.
Published: (2025)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
by: Gabric, Daniel, et al.
Published: (2026)

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
by: Yu, Lei
Published: (2025)

On the Codebook Design for NOMA Schemes from Bent Functions
by: Li, Chunlei, et al.
Published: (2025)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

Trifferent codes with small lengths
by: Kurz, Sascha
Published: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)

Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall $τ$-Metric
by: Nguyen, The
Published: (2024)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
by: Liang, Xue-Bin
Published: (2024)

Upper Bounds on the Average Height of Random Binary Trees
by: Benkner, Louisa Seelbach
Published: (2024)

An Upper Bound on the Linear Turán Number of $k$-Crowns
by: Adak, Rajat
Published: (2026)

Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
by: Anto, Nevil, et al.
Published: (2023)

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
by: Laddha, Aditi, et al.
Published: (2025)

Algorithmizing the Multiplicity Schwartz-Zippel Lemma
by: Bhandari, Siddharth, et al.
Published: (2021)

When does a bent concatenation not belong to the completed Maiorana-McFarland class?
by: Kudin, Sadmir, et al.
Published: (2024)

Nearly Orthogonal Sets over Finite Fields
by: Chawin, Dror, et al.
Published: (2024)

Millions of inequivalent quadratic APN functions in eight variables
by: Beierle, Christof, et al.
Published: (2025)

The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)

Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
by: Liu, Hai, et al.
Published: (2026)

Error-Correcting Graph Codes
by: Kopparty, Swastik, et al.
Published: (2024)

The capacity of a finite field matrix channel
by: Blackburn, Simon R., et al.
Published: (2022)

Bounds on Unique-Neighbor Codes
by: Linial, Nati, et al.
Published: (2022)

Independent sets and colorings of $K_{t,t,t}$-free graphs
by: Dhawan, Abhishek, et al.
Published: (2025)

Construction of orientable sequences in $O(1)$-amortized time per bit
by: Gabric, Daniel, et al.
Published: (2024)