This paper provides new and improved Singleton-like bounds for Lee metri...
We consider t-Lee-error-correcting codes of length n over the residue
ri...
Several recently proposed code-based cryptosystems base their security o...
We determine the asymptotic proportion of free modules over finite chain...
We introduce a new weight and corresponding metric over finite extension...
Due to the recent challenges in post-quantum cryptography, several new
a...
The Lee metric syndrome decoding problem is an NP-hard problem and sever...
In this paper, we study the hardness of decoding a random code endowed w...
The improvements on quantum technology are threatening our daily
cyberse...
In this paper we investigate known Singleton-like bounds in the Lee metr...
In this paper we focus on modules over a finite chain ring ℛ of
size q^s...
Coding Theory where the alphabet is identified with the elements of a ri...
In this paper, we present a new perspective of single server private
inf...
In this paper we introduce a variant of the Syndrome Decoding Problem (S...
We consider codes over finite rings endowed with the Lee metric and prov...
Information set decoding (ISD) algorithms are the best known procedures ...
We present a code-based public-key cryptosystem, in which we use Reed-So...
We convert Stern's information set decoding (ISD) algorithm to the ring
...
In this paper we generalize the Ball-Collision Algorithm by Bernstein, L...
In this paper we break the protocol based on the Diffie-Hellman Decompos...