A5054665295- Coding theory and cryptography
- Error Correcting Code Techniques
- Cooperative Communication and Network Coding
- graph theory and CDMA systems
- Advanced Wireless Communication Techniques
- Cryptographic Implementations and Security
- Finite Group Theory Research
- Cellular Automata and Applications
- Advanced Wireless Communication Technologies
- Cryptography and Residue Arithmetic
- Quantum Computing Algorithms and Architecture
- Chaos-based Image/Signal Encryption
- Advanced Data Storage Technologies
- Full-Duplex Wireless Communications
- Advanced biosensing and bioanalysis techniques
- DNA and Biological Computing
- Cryptography and Data Security
- Advanced MIMO Systems Optimization
- Telecommunications and Broadcasting Technologies
- Educational Methods and Media Use
- Energy Harvesting in Wireless Networks
- Advanced Wireless Network Optimization
- Polynomial and algebraic computation
- GNSS positioning and interference
- Optical Network Technologies
Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR)
2017-2024
Technical University of Munich
2014-2017
China Institute Of Communications
2015
The society as a whole, and many vertical sectors in particular, is becoming increasingly digitalized. Machine Type Communication (MTC), encompassing its massive critical aspects, ubiquitous wireless connectivity are among the main enablers of such digitization at large. recently introduced 5G New Radio natively designed to support both aspects MTC promote digital transformation society. However, it evident that some more demanding requirements cannot be fully supported by networks....
Abstract The recently introduced 5G New Radio is the first wireless standard natively designed to support critical and massive machine type communications (MTC). However, it already becoming evident that some of more demanding requirements for MTC cannot be fully supported by networks. Alongside, emerging use cases applications towards 2030 will give rise new stringent on connectivity in general particular. Next generation networks, namely 6G, should therefore an agile efficient convergent...
We speed up existing decoding algorithms for three code classes in different metrics: interleaved Gabidulin codes the rank metric, lifted subspace and linearized Reed-Solomon sum-rank metric. The speed-ups are achieved by new that reduce cores of underlying computational problems decoders to one common tool: computing left right approximant bases matrices over skew polynomial rings. To accomplish this, we describe a skew-analogue PM-Basis algorithm ordinary polynomials. This captures bulk...
The rank metric measures the distance between two matrices by of their difference.Codes designed for have attracted considerable attention in recent years, reinforced network coding and further motivated a variety applications.In code-based cryptography, hardness corresponding generic decoding problem can lead to systems with reduced public-key size.In distributed data storage, codes been used repeatedly construct locality, coded caching, they employed placement symbols.This survey gives...
Recently, Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory, 2019) showed that lifted linearized Reed-Solomon codes are suitable for error control in multishot network coding. We show how to construct decode interleaved codes. Compared the construction by Martínez-Peñas-Kschischang, interleaving allows increase decoding region significantly (especially w.r.t. number of insertions) decreases overhead due lifting (i.e., increases code rate), at cost an increased packet size. The proposed...
An interpolation-based decoding scheme for interleaved subspace codes is presented. The can be used as a (not necessarily polynomial-time) list decoder well probabilistic unique decoder. Both interpretations allow to decode beyond half the minimum distance. Further, an efficient interpolation procedure required linearized multivariate polynomials presented and computationally- memory-efficient root-finding algorithm proposed. These two algorithms also applied accelerating of Gabidulin codes.
Recently, it has been shown how McEliece public-key cryptosystems based on moderate-density parity-check (MDPC) codes allow for very compact keys compared to variants other code families. In this paper, classical (iterative) decoding schemes MPDC are considered. The algorithms analyzed with respect their error-correction capability as well resilience against a recently proposed reaction-based key-recovery attack variant of the MDPC-McEliece cryptosystem by Guo, Johansson and Stankovski...
An interpolation-based decoding scheme for $L$-interleaved subspace codes is presented. The can be used as a (not necessarily polynomial-time) list decoder well polynomial-time probabilistic unique decoder. Both interpretations allow to decode interleaved beyond half the minimum distance. schemes $\gamma $ insertions and $\delta deletions up +L\delta \leq L({{n}_{t}}-k)$, where ${{n}_{t}}$ dimension of transmitted $k$ number data symbols from field ${{\mathbb{F}}_{{{q}^{m}}}}$. Further,...
A new class of folded subspace codes for noncoherent network coding is presented. The can correct insertions and deletions beyond the unique decoding radius any code rate R ∈ [0, 1]. An efficient interpolation-based algorithm this construction given which allows to up normalized s (1 - ((1/h + h)/(h 1))R), where h folding parameter ≤ a parameter. serves as list decoder or probabilistic that outputs solution with high probability. upper bound on average size (folded) failure probability...
An efficient decoding algorithm for horizontally u-interleaved LRPC codes is proposed and analyzed. Upper bounds on the failure rate computational complexity of are derived. It shown that interleaving reduces exponentially in order u whereas grows linearly.
Codes in the sum-rank metric have various applications error control for multishot network coding, distributed storage and code-based cryptography. Linearized Reed-Solomon (LRS) codes contain Gabidulin as subclasses fulfill Singleton-like bound with equality. We propose first known error-erasure decoder LRS to unleash their full potential coding by incorporating erasures into syndrome-based Berlekamp-Massey-like decoder. This allows correct t <inf...
Network coding allows nodes in a network to combine different packets using linear operations. In most instances, the encoding coefficients are chosen randomly and placed packet header. The ability correct errors erasures is critical, because single malicious injected by misbehaving node or deletion of can corrupt multiple jeopardize entire information flow. Building on Rotter Kschischang's theoretical work subspace codes, we propose practical protocol with in-built resilience against faults...
Abstract The sum-rank metric is a hybrid between the Hamming and rank suitable for error correction in multishot network coding distributed storage as well design of quantum-resistant cryptosystems. In this work, we consider construction decoding folded linearized Reed–Solomon (FLRS) codes, which are shown to be maximum distance (MSRD) appropriate parameter choices. We derive an efficient interpolation-based algorithm FLRS codes that can used list decoder or probabilistic unique decoder....
In this paper, ensembles of quasi-cyclic moderate-density parity-check (MDPC) codes based on protographs are introduced and analyzed in the context a McEliece-like cryptosystem. The proposed significantly improve error correction capability regular MDPC code that currently considered for post-quantum cryptosystems without increasing public key size. obtained by threshold optimization (via density evolution analysis), both under sum-product algorithm low-complexity (error-and-erasure) message...
Summary VDES R‐Mode aims at providing a contingency maritime positioning and navigation system when the operation of Global Navigation Satellite Systems (GNSS) is disrupted. However, R‐Mode, similarly to GNSS, can itself also be subject different types attacks, such as jamming or spoofing. In this paper, we evaluate vulnerabilities discuss effectiveness cost countermeasures. The outcome cost‐benefit analysis recommendation introduce authentication for messages using Timed Efficient Stream...