Loading [a11y]/accessibility-menu.js
Ruixin Niu - IEEE Xplore Author Profile
Subscribe
ADVANCED SEARCH

Author details

< Back

Ruixin Niu

Also published under: R. Niu

Publications
86
Citations
1,731
Publications by Year
20002024
Co-Authors:
Show All Co-Authors (53)
Image of author Ruixin Niu

Ruixin Niu

Also published under: R. Niu

Affiliation

Dept. of ECE, Virginia Commonwealth University

Publication Topics

Biography

Ruixin Niu received his B.S. degree from Xian Jiaotong University, Xian, China, in 1994, M.S. degree from the Institute of Electronics, Chinese Academy of Sciences, Beijing, in 1997, and Ph.D. degree from the University of Connecticut, Storrs, in 2001, all in Electrical Engineering. He is currently an Associate Professor with the Department of Electrical and Computer Engineering, Virginia Commonwealth University, Richmond, VA. His research interests are in the areas of statistical signal processing and its applications, including detection, estimation, tracking, information fusion, sensor networks, communications, and compressive sensing. Dr. Niu received the Best Paper Award at the Seventh International Conference on Information Fusion in ...
Publications
86
Citations
1,731
Publications by Year
20002024
Co-Authors:
Show All Co-Authors (53)
Author's Published Works

Showing 1-17 of 17 results

  • Sort

Filter Results

Show

Sort By

Results

A Combinatorial Perspective on Random Access Efficiency for DNA Storage

Anina Gruica;Daniella Bar-Lev;Alberto Ravagnani;Eitan Yaakobi

2024 IEEE International Symposium on Information Theory (ISIT)
Year: 2024 | Conference Paper |
We investigate the fundamental limits of the recently proposed random access coverage depth problem for DNA data storage. Under this paradigm, it is assumed that the user information consists of $k$ information strands, which are encoded into $n$ strands via some generator matrix $G$. In the sequencing process, the strands are read uniformly at random, since each strand is available in a large num...Show More

A Combinatorial Perspective on Random Access Efficiency for DNA Storage

Anina Gruica;Daniella Bar-Lev;Alberto Ravagnani;Eitan Yaakobi

Year: 2024 | Conference Paper |

On the Parameters of Codes for Data Access

Altan B. Kılıç;Alberto Ravagnani;Emina Soljanin

2024 IEEE International Symposium on Information Theory (ISIT)
Year: 2024 | Conference Paper |
This paper studies two crucial problems in the context of coded distributed storage systems directly related to their performance: 1) for a fixed alphabet size, determine the minimum number of servers the system must have for its service rate region to contain a prescribed set of points; 2) for a given number of servers, determine the minimum alphabet size for which the service rate region of the ...Show More

On the Parameters of Codes for Data Access

Altan B. Kılıç;Alberto Ravagnani;Emina Soljanin

Year: 2024 | Conference Paper |

Weighted-Hamming Metric for Parallel Channels

Sebastian Bitzer;Alberto Ravagnani;Violetta Weger

2024 IEEE International Symposium on Information Theory (ISIT)
Year: 2024 | Conference Paper |
Independent parallel q-ary symmetric channels are a suitable transmission model for several applications. The weighted-Hamming metric is tailored to this setting and enables optimal decoding performance. We show that some weighted-Hamming-metric codes exhibit the unusual property that all errors beyond half the minimum distance can be corrected. Nevertheless, a tight relation between the error-cor...Show More

Weighted-Hamming Metric for Parallel Channels

Sebastian Bitzer;Alberto Ravagnani;Violetta Weger

Year: 2024 | Conference Paper |

Eigenvalue Bounds for Sum-Rank-Metric Codes

Aida Abiad;Antonina P. Khramova;Alberto Ravagnani

IEEE Transactions on Information Theory
Year: 2024 | Volume: 70, Issue: 7 | Journal Article |
Cited by: Papers (3)
We consider the problem of deriving upper bounds on the parameters of sum-rank-metric codes, with focus on their dimension and block length. The sum-rank metric is a combination of the Hamming and the rank metric, and most of the available techniques to investigate it seem to be unable to fully capture its hybrid nature. In this paper, we introduce a new approach based on sum-rank-metric graphs, i...Show More

Eigenvalue Bounds for Sum-Rank-Metric Codes

Aida Abiad;Antonina P. Khramova;Alberto Ravagnani

Year: 2024 | Volume: 70, Issue: 7 | Journal Article |

ℓ-Complementary Subspaces and Codes in Finite Bilinear Spaces

Heide Gluesing-Luerssen;Alberto Ravagnani

IEEE Transactions on Information Theory
Year: 2024 | Volume: 70, Issue: 4 | Journal Article |
Cited by: Papers (1)
We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell $ -complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell $ . This concept generalizes that of a totally isotropic subspace and, in the context of coding theory, specializes to the notions of self-orthogonal, self-dual and linear-complementa...Show More

ℓ-Complementary Subspaces and Codes in Finite Bilinear Spaces

Heide Gluesing-Luerssen;Alberto Ravagnani

Year: 2024 | Volume: 70, Issue: 4 | Journal Article |

Service Aspects of LRC and Batch Codes

Gianira N. Alfarano;Altan B. Kılıç;Alberto Ravagnani

IEEE BITS the Information Theory Magazine
Year: 2023 | Volume: 3, Issue: 4 | Magazine Article |
Cited by: Papers (1)
Distributed storage systems often use locally recoverable codes for easy repair of node failure and batch codes for load balancing. In this survey, we give an expository overview of the service aspects of these two families of codes. Moreover, we revisit different connections between the service rate problem and other relevant concepts in information and coding theory, using tools from finite and ...Show More

Service Aspects of LRC and Batch Codes

Gianira N. Alfarano;Altan B. Kılıç;Alberto Ravagnani

Year: 2023 | Volume: 3, Issue: 4 | Magazine Article |

Multishot Adversarial Network Decoding

Giuseppe Cotardo;Gretchen L. Matthews;Julia Shapiro;Alberto Ravagnani

2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Year: 2023 | Conference Paper |
We investigate adversarial network coding and decoding focusing on the multishot regime. Errors can occur on a proper subset of the network edges and are modeled via an adversarial channel. The paper contains both bounds and capacity-achieving schemes for the Diamond Network and the Mirrored Diamond Network. We also initiate the study of the generalizations of these networks.Show More

Multishot Adversarial Network Decoding

Giuseppe Cotardo;Gretchen L. Matthews;Julia Shapiro;Alberto Ravagnani

Year: 2023 | Conference Paper |

The Role of the Alphabet in Network Coding: An Optimization Approach

Christopher Hojny;Altan B. Kılıç;Alberto Ravagnani

2023 IEEE Information Theory Workshop (ITW)
Year: 2023 | Conference Paper |
Cited by: Papers (2)
We consider the problem of determining the one-shot, zero-error capacity of a coded, multicast network over a small alphabet. We introduce a novel approach to this problem based on a mixed-integer program, which computes the size of the largest unambiguous codebook for a given alphabet size. As an application of our approach, we recover, extend and refine various results that were previously obtai...Show More

The Role of the Alphabet in Network Coding: An Optimization Approach

Christopher Hojny;Altan B. Kılıç;Alberto Ravagnani

Year: 2023 | Conference Paper |

Duality and LP Bounds for Codes with Locality

Anina Gruica;Benjamin Jany;Alberto Ravagnani

2023 IEEE Information Theory Workshop (ITW)
Year: 2023 | Conference Paper |
We initiate the study of the duality theory of locally recoverable codes, with a focus on the applications. We characterize the locality of a code in terms of the dual code, and introduce a class of invariants that refine the classical weight distribution. In this context, we establish a duality theorem analogous to (but very different from) a MacWilliams identity. As an application of our results...Show More

Duality and LP Bounds for Codes with Locality

Anina Gruica;Benjamin Jany;Alberto Ravagnani

Year: 2023 | Conference Paper |

Network Decoding

Allison Beemer;Altan B. Kılıç;Alberto Ravagnani

IEEE Transactions on Information Theory
Year: 2023 | Volume: 69, Issue: 6 | Journal Article |
Cited by: Papers (3)
We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal framework and a series of techniques to obtain upper and lower bounds on the network’s (1-shot) capacity, improving on the best currently known results. In partic...Show More

Network Decoding

Allison Beemer;Altan B. Kılıç;Alberto Ravagnani

Year: 2023 | Volume: 69, Issue: 6 | Journal Article |

Dual-Code Bounds on Multiple Concurrent (Local) Data Recovery

Gianira N. Alfarano;Alberto Ravagnani;Emina Soljanin

2022 IEEE International Symposium on Information Theory (ISIT)
Year: 2022 | Conference Paper |
Cited by: Papers (3)
We are concerned with linear redundancy storage schemes regarding their ability to provide concurrent (local) recovery of multiple data objects. This paper initiates a study of such systems within the classical coding theory. We show how we can use the structural properties of the generator matrix defining the scheme to obtain a bounding polytope for the set of data access rates the system can sup...Show More

Dual-Code Bounds on Multiple Concurrent (Local) Data Recovery

Gianira N. Alfarano;Alberto Ravagnani;Emina Soljanin

Year: 2022 | Conference Paper |

Parameters of Codes for the Binary Asymmetric Channel

Giuseppe Cotardo;Alberto Ravagnani

IEEE Transactions on Information Theory
Year: 2022 | Volume: 68, Issue: 5 | Journal Article |
Cited by: Papers (1)
We introduce two notions of discrepancy between binary vectors, which are not metric functions in general but nonetheless capture the mathematical structure of the binary asymmetric channel. These lead to two new fundamental parameters of binary error-correcting codes, both of which measure the probability that the maximum likelihood decoder fails. We then derive various bounds for the cardinality...Show More

Parameters of Codes for the Binary Asymmetric Channel

Giuseppe Cotardo;Alberto Ravagnani

Year: 2022 | Volume: 68, Issue: 5 | Journal Article |

The Typical Non-Linear Code over Large Alphabets

Anina Gruica;Alberto Ravagnani

2021 IEEE Information Theory Workshop (ITW)
Year: 2021 | Conference Paper |
Cited by: Papers (1)
We consider the problem of describing the typical (possibly) non-linear code of minimum distance bounded from below over a large alphabet. We concentrate on block codes with the Hamming metric and on subspace codes with the injection metric. In sharp contrast with the behavior of linear block codes, we show that the typical non-linear code in the Hamming metric of cardinality $q^{n-d+1}$ is far fr...Show More

The Typical Non-Linear Code over Large Alphabets

Anina Gruica;Alberto Ravagnani

Year: 2021 | Conference Paper |

Fundamental Properties of Sum-Rank-Metric Codes

Eimear Byrne;Heide Gluesing-Luerssen;Alberto Ravagnani

IEEE Transactions on Information Theory
Year: 2021 | Volume: 67, Issue: 10 | Journal Article |
Cited by: Papers (21)
This paper investigates the theory of sum-rank-metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory of sum-rank-metric codes is also explored, showing that MSRD codes (the sum-rank analogue of MDS codes) dualize to MSRD codes only if all matrix blocks have th...Show More

Fundamental Properties of Sum-Rank-Metric Codes

Eimear Byrne;Heide Gluesing-Luerssen;Alberto Ravagnani

Year: 2021 | Volume: 67, Issue: 10 | Journal Article |

Adversarial Network Coding

Alberto Ravagnani;Frank R. Kschischang

IEEE Transactions on Information Theory
Year: 2019 | Volume: 65, Issue: 1 | Journal Article |
Cited by: Papers (10)
A combinatorial framework for adversarial network coding is presented. Channels are described by specifying the possible actions that one or more (possibly coordinated) adversaries may take. Upper bounds on three notions of capacity—the one-shot capacity, the zero-error capacity, and the compound zero-error capacity—are obtained for point-to-point channels, and generalized to corresponding capacit...Show More

Adversarial Network Coding

Alberto Ravagnani;Frank R. Kschischang

Year: 2019 | Volume: 65, Issue: 1 | Journal Article |

An Algebraic Framework for End-to-End Physical-Layer Network Coding

Elisa Gorla;Alberto Ravagnani

IEEE Transactions on Information Theory
Year: 2018 | Volume: 64, Issue: 6 | Journal Article |
Cited by: Papers (9)
We propose an algebraic framework for end-to-end physical-layer network coding based on submodules transmission. Our approach is motivated by nested-lattice-based network coding schemes, that naturally induce end-to-end channels where the ambient space has the structure of a module over a principal ideal ring. The setup is compatible with previously proposed approaches for finite chain rings, and ...Show More

An Algebraic Framework for End-to-End Physical-Layer Network Coding

Elisa Gorla;Alberto Ravagnani

Year: 2018 | Volume: 64, Issue: 6 | Journal Article |

Optimal Ferrers Diagram Rank-Metric Codes

Tuvi Etzion;Elisa Gorla;Alberto Ravagnani;Antonia Wachter-Zeh

IEEE Transactions on Information Theory
Year: 2016 | Volume: 62, Issue: 4 | Journal Article |
Cited by: Papers (31)
Optimal rank-metric codes in Ferrers diagrams are considered. Such codes consist of matrices having zeros at certain fixed positions and can be used to construct good codes in the projective space. First, we consider rank-metric anticodes and prove a code-anticode bound for Ferrers diagram rank-metric codes. The size of optimal linear anticodes is given. Four techniques and constructions of Ferrer...Show More

Optimal Ferrers Diagram Rank-Metric Codes

Tuvi Etzion;Elisa Gorla;Alberto Ravagnani;Antonia Wachter-Zeh

Year: 2016 | Volume: 62, Issue: 4 | Journal Article |

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.