Search Results - rank decoding (problem OR problems)*
-
1
On the Complexity of the Rank Syndrome Decoding Problem
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.02.2016Published in IEEE transactions on information theory (01.02.2016)“…In this paper, we propose two new generic attacks on the rank syndrome decoding (RSD) problem. Let C be a random [n, k] rank code over GF(q m ) and let y = x + e be a received word, such that x…”
Get full text
Journal Article -
2
Generic Decoding in the Sum-Rank Metric
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.08.2022Published in IEEE transactions on information theory (01.08.2022)“…We propose the first non-trivial generic decoding algorithm for codes in the sum-rank metric…”
Get full text
Journal Article -
3
On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.12.2016Published in IEEE transactions on information theory (01.12.2016)“…We give a randomized reduction for the Rank Syndrome Decoding problem and Rank Minimum Distance problem for rank codes over extension fields…”
Get full text
Journal Article -
4
Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems With Smaller Sizes
ISSN: 0018-9448, 1557-9654Published: IEEE 01.06.2025Published in IEEE transactions on information theory (01.06.2025)“…In this paper, we initiate the study of the Rank Decoding (RD) problem and Low Rank Parity Check (LRPC…”
Get full text
Journal Article -
5
Revisiting algebraic attacks on MinRank and on the rank decoding problem
ISSN: 0925-1022, 1573-7586Published: New York Springer US 01.11.2023Published in Designs, codes, and cryptography (01.11.2023)“…The Rank Decoding problem (RD) is at the core of rank-based cryptography. Cryptosystems such as ROLLO and RQC, which made it to the second round of the NIST…”
Get full text
Journal Article -
6
RYDE: a digital signature scheme based on rank syndrome decoding problem with MPC-in-the-Head paradigm
ISSN: 0925-1022, 1573-7586Published: Dordrecht Springer Nature B.V 01.05.2025Published in Designs, codes, and cryptography (01.05.2025)“…We present a signature scheme based on the syndrome decoding (SD) problem in rank metric…”
Get full text
Journal Article -
7
RYDE: a digital signature scheme based on rank syndrome decoding problem with MPC-in-the-Head paradigm: RYDE: a digital signature scheme
ISSN: 0925-1022, 1573-7586Published: New York Springer US 01.05.2025Published in Designs, codes, and cryptography (01.05.2025)“…We present a signature scheme based on the syndrome decoding (SD) problem in rank metric…”
Get full text
Journal Article -
8
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.08.2021Published in IEEE transactions on information theory (01.08.2021)“…We speed up existing decoding algorithms for three code classes in different metrics…”
Get full text
Journal Article -
9
QOSTBC coded MIMO system with reduced complexity and optimised decoding for rank deficient channels
ISSN: 1751-8628, 1751-8636Published: The Institution of Engineering and Technology 03.03.2020Published in IET communications (03.03.2020)“… = 4 with modified double-layer SD detection to overcome rank deficiency problem. The first half of transmitted symbols is detected using two partially dependent SDs with optimised search radii…”
Get full text
Journal Article -
10
A New Algorithm for Solving the Rank Syndrome Decoding Problem
ISSN: 2157-8117Published: IEEE 01.06.2018Published in 2018 IEEE International Symposium on Information Theory (ISIT) (01.06.2018)“…In this paper, we propose an improvement of the attack on the Rank Syndrome Decoding (RSD) problem found in [1…”
Get full text
Conference Proceeding -
11
Algebraic List-Decoding in Projective Space: Decoding With Multiplicities and Rank-Metric Codes
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.02.2019Published in IEEE transactions on information theory (01.02.2019)“…The problem of list decoding algebraic subspace codes and rank-metric codes is considered…”
Get full text
Journal Article -
12
Minimizing low-rank models of high-order tensors: Hardness, span, tight relaxation, and applications
ISSN: 1053-587X, 1941-0476Published: New York IEEE 01.01.2024Published in IEEE transactions on signal processing (01.01.2024)“…We consider the problem of finding the smallest or largest entry of a tensor of order N that is specified via its rank decomposition…”
Get full text
Journal Article -
13
LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
ISSN: 0925-1022, 1573-7586Published: New York Springer US 01.06.2021Published in Designs, codes, and cryptography (01.06.2021)“…We propose the new rank-metric code-based cryptosystem LIGA which is based on the hardness of l ist decoding and i nterleaved decoding of Ga bidulin codes…”
Get full text
Journal Article -
14
On the Analytical Solution of Rank Problem in the Convolutional Code Identification Context
ISSN: 1089-7798, 1558-2558Published: New York IEEE 01.03.2016Published in IEEE communications letters (01.03.2016)“…The rank-based method is very effective to identify the convolutional code parameters in a non-cooperative context…”
Get full text
Journal Article -
15
The "Art of Trellis Decoding" Is Fixed-Parameter Tractable
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.11.2017Published in IEEE transactions on information theory (01.11.2017)“… When restricted to 1-dimensional subspaces, this problem is equivalent to computing the trellis-width…”
Get full text
Journal Article -
16
On the hardnesses of several quantum decoding problems
ISSN: 1570-0755, 1573-1332Published: New York Springer US 01.04.2020Published in Quantum information processing (01.04.2020)“…We classify the time complexities of three decoding problems for quantum stabilizer codes…”
Get full text
Journal Article -
17
Low-rank, Orthogonally Decomposable Tensor Regression With Application to Visual Stimulus Decoding of fMRI Data
ISSN: 1061-8600, 1537-2715Published: Alexandria Taylor & Francis 02.01.2022Published in Journal of computational and graphical statistics (02.01.2022)“… We propose to reduce the dimensionality of the problem by imposing a low-rank assumption on the parameter tensor, which not only reduces the number of parameters…”
Get full text
Journal Article -
18
A hybrid multifactorial evolutionary algorithm and firefly algorithm for the clustered minimum routing cost tree problem
ISSN: 0950-7051, 1872-7409Published: Amsterdam Elsevier B.V 06.04.2022Published in Knowledge-based systems (06.04.2022)“…The clustered minimum routing cost tree (CluMRCT) problem is a recent problem with a wide range of real-life applications, especially in designing computer networks with peer-to-peer architecture…”
Get full text
Journal Article -
19
Solving systems of algebraic equations over finite commutative rings and applications
ISSN: 0938-1279, 1432-0622Published: Heidelberg Springer Nature B.V 01.11.2025Published in Applicable algebra in engineering, communication and computing (01.11.2025)“… Among these problems, we have the rank decoding problem, which is used in the construction of public-key cryptosystems…”
Get full text
Journal Article -
20
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
ISSN: 2575-8454Published: IEEE 27.10.2024Published in Proceedings / annual Symposium on Foundations of Computer Science (27.10.2024)“… However, unlike the fruitful positive results about the list decoding of Reed-Solomon codes, results concerning the list decodability of Gabidulin codes in the rank metric are all negative so far…”
Get full text
Conference Proceeding