Search:
Match:
2 results

Analysis

This paper investigates the maximum number of touching pairs in a packing of congruent circles in the hyperbolic plane. It provides upper and lower bounds for this number, extending previous work on Euclidean and specific hyperbolic tilings. The results are relevant to understanding the geometric properties of circle packings in non-Euclidean spaces and have implications for optimization problems in these spaces.
Reference

The paper proves that for certain values of the circle diameter, the number of touching pairs is less than that from a specific spiral construction, which is conjectured to be extremal.

Tilings of Constant-Weight Codes

Published:Dec 28, 2025 02:56
1 min read
ArXiv

Analysis

This paper explores the tiling problem of constant-weight codes, a fundamental topic in coding theory. It investigates partitioning the Hamming space into optimal codes, focusing on cases with odd and even distances. The paper provides construction methods and resolves the existence problem for specific distance values (d=2 and d=2w), particularly for weight three. The results contribute to the understanding of code structures and their applications.
Reference

The paper completely resolves the existence problem of $\mathrm{TOC}_{q}(n,d,w)$s for the cases $d=2$ and $d=2w$.