Valjakas Djaljapayan

most citedStability for hyperplane covers

1 citations · 1 across the 1 of their papers we have counts for

collaborators

3 papers

math.CO2026

The Ternary and Quaternary Cases of the ${2, 4}$ -Distance Code Conjecture

Yen-Chi Roger Lin, Valjakas Djaljapayan, Wei-Hsuan Yu

For an integer $q \geq 2$ , let $A_{q} (n, {2, 4})$ be the largest cardinality of an unrestricted $q$ -ary code of length $n$ in which any two distinct words have Hamming distance $2$ or $…

math.CO2026

Asymptotically Sharp Length Thresholds for \texorpdfstring{ $q$ }{q}-ary Codes with Distances \texorpdfstring{ $2$ }{2} and \texorpdfstring{ $4$ }{4}

Valjakas Djaljapayan, Yen-Chi Roger Lin, Wei-Hsuan Yu

For an integer $q \geq 5$ , let $A_{q} (n, {2, 4})$ be the largest cardinality of a subset of a $q$ -ary Hamming space of length $n$ in which every two distinct words have distance $2$ or…

math.CO2023★ 1 cited

Stability for hyperplane covers

Shagnik Das, Valjakas Djaljapayan, Yen-chi Roger Lin +1

An almost $k$ -cover of the hypercube $Q^{n} = {0, 1}^{n}$ is a collection of hyperplanes that avoids the origin and covers every other vertex at least $k$ times. When $k$ is large wit…

The Ternary and Quaternary Cases of the {2,4}-Distance Code Conjecture

Asymptotically Sharp Length Thresholds for \texorpdfstring{q}{q}-ary Codes with Distances \texorpdfstring{2}{2} and \texorpdfstring{4}{4}

Stability for hyperplane covers

The Ternary and Quaternary Cases of the ${2, 4}$ -Distance Code Conjecture

Asymptotically Sharp Length Thresholds for \texorpdfstring{ $q$ }{q}-ary Codes with Distances \texorpdfstring{ $2$ }{2} and \texorpdfstring{ $4$ }{4}