In this work, we introduce a new code-based signature scheme, called FuLeeca, based on
the NP-hard problem of finding codewords of given Lee-weight. The scheme follows the …

The improvements on quantum technology are threatening our daily cybersecurity, as a
capable quantum computer can break all currently employed asymmetric cryptosystems. In …

In this paper we study the hardness of the syndrome decoding problem over finite rings
endowed with the Lee metric. We first prove that the decisional version of the problem is NP …

In this paper we investigate known Singleton-like bounds in the Lee metric and characterize
their extremal codes, which turn out to be very few. We then focus on Plotkin-like bounds in …

The Lee metric syndrome decoding problem is an NP-hard problem and several generic
decoders have been proposed. The observation that such decoders come with a larger cost …

This paper provides new and improved Singleton-like bounds for Lee metric codes over
integer residue rings. We derive the bounds using various novel definitions of generalized …

Coding theory where the alphabet is identified with the elements of a ring or a module has
become an important research topic over the last 30 years. It has been well established that …

String functions are important building blocks of characters of integrable highest modules
over affine Kac–Moody algebras. Kac and Peterson computed string functions for affine Lie …

Abstract Information set decoding (ISD) algorithms currently offer the most powerful tool to
solve the two archetypal problems of coding theory, namely the Codeword Finding Problem …

Independent parallel q-ary symmetric channels are a suitable transmission model for
several applications. The proposed weighted-Hamming metric is tailored to this setting and …