Péter Ligeti

Suggest Changes
Learn More
In the paper two variants of a combinatorial problem for the set F q of sequences of length n over the alphabet Fq = {0, 1, .., q − 1} are considered, with some applications. The original problem was(More)