Cover Image

On low-power error-correcting cooling codes with large distances

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhao, Yuhao, Zhang, Xiande
Format:	Preprint
Published:	2024
Subjects:	Information Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved upper bounds for wide-sense frameproof codes
by: Zhao, Yuhao, et al.
Published: (2024)

Focal-free uniform hypergraphs and codes
by: Huang, Xinqi, et al.
Published: (2024)

Optimal redundancy of function-correcting codes
by: Ge, Gennian, et al.
Published: (2025)

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

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

Bounds on $k$-hash distances and rates of linear codes
by: Della Fiore, Stefano, et al.
Published: (2025)

On the size of maximal binary codes with 2, 3, and 4 distances
by: Barg, Alexander, et al.
Published: (2022)

Authenticated partial correction over AV-MACs: toward characterization and coding
by: Koepke, Duncan, et al.
Published: (2024)

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

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
by: Xiong, Yanzhen, et al.
Published: (2026)

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

Counting cliques with prescribed intersection sizes
by: Zhao, Yuhao, et al.
Published: (2025)

Additive codes from linear codes
by: Ball, Simeon, et al.
Published: (2025)

Trellis codes with a good distance profile constructed from expander graphs
by: Zhu, Yubin, et al.
Published: (2026)

On the minimum Hamming distance between vectorial Boolean and affine functions
by: Nagy, Gabor P.
Published: (2025)

On the error correction of iterative bounded distance decoding of generalized LDPC codes
by: Burshtein, David
Published: (2025)

Latroids and code invariants
by: Gorla, Elisa, et al.
Published: (2025)

Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes
by: Ozbudak, Ferruh, et al.
Published: (2024)

Error-detecting solid codes
by: Carruth, Nathan Thomas
Published: (2026)

On maximal almost balanced non-overlapping codes and non-overlapping codes with restricted run-lengths
by: Stanovnik, Lidija, et al.
Published: (2024)

Non-commutative error correcting codes and proper subgroup testing
by: Chapman, Michael, et al.
Published: (2024)

Near optimal constructions of frameproof codes
by: Liu, Miao, et al.
Published: (2024)

On perfect symmetric rank-metric codes
by: Mushrraf, Usman, et al.
Published: (2024)

Two-weight rank-metric codes
by: Zullo, Ferdinando, et al.
Published: (2024)

Linear rank-metric intersecting codes
by: Bartoli, Daniele, et al.
Published: (2025)

Quasi-optimal cyclic orbit codes
by: Castello, Chiara, et al.
Published: (2025)

Eigenvalue bounds and alternating rank-metric codes
by: Abiad, Aida, et al.
Published: (2024)

Binary codes from subset inclusion matrices
by: Marin, Alexey D., et al.
Published: (2024)

Optimal codes and arcs for the generalized Hamming weights
by: Kurz, Sascha, et al.
Published: (2026)

On the existence of linear rank-metric intersecting codes
by: Borello, Martino, et al.
Published: (2026)

Short rank-metric codes and scattered subspaces
by: Lia, Stefano, et al.
Published: (2023)

On the number of inequivalent linearized Reed-Solomon codes
by: Mannaert, Jonathan, et al.
Published: (2026)

Decoding rank metric Reed-Muller codes
by: Couvreur, Alain, et al.
Published: (2025)

Block components of generalized quaternion group codes
by: Willenborg, Nadja
Published: (2025)

One-weight codes in the sum-rank metric
by: Mushrraf, Usman, et al.
Published: (2025)

On the weight distribution of random binary linear codes
by: Linial, Nati, et al.
Published: (2018)

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)

Explicit constructions of optimal blocking sets and minimal codes
by: Bishnoi, Anurag, et al.
Published: (2024)

More MDS codes of non-Reed-Solomon type
by: Wu, Yansheng, et al.
Published: (2024)

Geometric construction of k-optimal locally repairable codes
by: Fu, Yi, et al.
Published: (2026)