4 papers · 1 filter
Clique covers and decompositions of cliques of graphs
József Balogh, Jialin He, Robert A. Krueger +2
In 1966, Erdős, Goodman, and Pósa showed that if is an -vertex graph, then at most cliques of are needed to cover the edges of , and the bound…
Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall -Metric
The Nguyen
The Cayley distance between two permutations is the minimum number of \textit{transpositions} required to obtain the permutation from . When we only allow adja…
Improving Uniquely Decodable Codes in Binary Adder Channels
József Balogh, The Nguyen, Patric R. J. Ostergard +2
We present a general method to modify existing uniquely decodable codes in the -user binary adder channel. If at least one of the original constituent codes does not have averag…
A point-plane incidence theorem in matrix rings
Nguyen Van The, Le Anh Vinh
In this paper, we study a point-hyper plane incidence theorem in matrix rings, which generalizes all previous works in literature of this direction.