English
Related papers

Related papers: Construction of dyadic MDS matrices for cryptograp…

200 papers

In inverting large sparse matrices, the key difficulty lies in effectively exploiting sparsity during the inversion process. One well-established strategy is the nested dissection, which seeks the so-called sparse Cholesky factorization. We…

Numerical Analysis · Mathematics 2025-05-14 Michał Kos , Krzysztof Podgórski , Hanqing Wu

In this paper, we propose two novel modulation concepts based on a simple maximum distance separable (MDS) code { and show that these concepts can achieve better error performance than index modulation (IM) and related schemes.} In the…

Signal Processing · Electrical Eng. & Systems 2021-08-11 Ferhat Yarkin , Justin P. Coon

The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of constructing UDMs is tightly connected to the problem of…

Information Theory · Computer Science 2007-07-13 Pascal O. Vontobel , Ashwin Ganesan

Maximum distance separable (MDS) and almost maximum distance separable (AMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes because of their algebraic properties and excellent…

Information Theory · Computer Science 2026-04-08 Meiying Zhang , Shudi Yang , Yanbin Zheng

We present a set of algorithms implementing multidimensional scaling (MDS) for large data sets. MDS is a family of dimensionality reduction techniques using a $n \times n$ distance matrix as input, where $n$ is the number of individuals,…

Computation · Statistics 2024-02-02 Pedro Delicado , Cristian Pachón-García

In this paper, we propose a new secure distributed matrix multiplication (SDMM) scheme using the inner product partitioning. We construct a scheme with a minimal number of workers and no redundancy, and another scheme with redundancy…

Information Theory · Computer Science 2024-04-29 Okko Makkonen

Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This…

Information Theory · Computer Science 2017-02-28 Bocong Chen , Hongwei Liu

The growing privacy concerns and the communication costs associated with transmitting raw data have resulted in techniques like federated learning, where the machine learning models are trained at the edge nodes, and the parameter updates…

Information Theory · Computer Science 2023-11-27 M. Nikhil Krishnan , Anoop Thomas , Birenjith Sasidharan

The paper is devoted to the problem of erasure coding in distributed storage. We consider a model of storage that assumes that nodes are organized into equally sized groups, called racks, that within each group the nodes can communicate…

Information Theory · Computer Science 2019-01-15 Zitan Chen , Alexander Barg

Circulant Maximum Distance Separable (MDS) matrices have gained significant importance due to their applications in the diffusion layer of the AES block cipher. In $2013$, Gupta and Ray established that circulant involutory matrices of…

Cryptography and Security · Computer Science 2024-06-25 Tapas Chatterjee , Ayantika Laha

Masked diffusion language models (MDLMs) have recently emerged as a new paradigm in language modeling, offering flexible generation dynamics and enabling efficient parallel decoding. However, existing decoding strategies for pre-trained…

Computation and Language · Computer Science 2026-03-17 Xueyu Zhou , Yangrong Hu , Jian Huang

Machine Learning (ML) is used for developing wall functions for Improved Delayed Detached Eddy Simulations (IDDES). The ML model is based on KDtree which essentially is a fast look-up table. It searches the nearest target datapoint(s) for…

Fluid Dynamics · Physics 2025-03-04 Lars Davidson

Distributed storage codes have important applications in the design of modern storage systems. In a distributed storage system, every storage node has a probability to fail and once an individual storage node fails, it must be reconstructed…

Information Theory · Computer Science 2016-10-27 Chong Shangguan , Gennian Ge

Multidimensional scaling (MDS) is a popular dimensionality reduction techniques that has been widely used for network visualization and cooperative localization. However, the traditional stress minimization formulation of MDS necessitates…

Optimization and Control · Mathematics 2016-12-22 Ketan Rajawat , Sandeep Kumar

Masked Diffusion Models (MDMs) offer a promising alternative to autoregressive language models by enabling parallel token generation and bidirectional context modeling. However, their inference speed is significantly limited by the…

Machine Learning · Computer Science 2026-04-08 Satyam Goyal , Kushal Patel , Tanush Mittal , Arjun Laxman

Nonnegative matrix factorization (NMF) has attracted much attention in the last decade as a dimension reduction method in many applications. Due to the explosion in the size of data, naturally the samples are collected and stored…

Machine Learning · Computer Science 2018-02-27 Tianxiang Gao , Chris Chu

MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual…

Information Theory · Computer Science 2019-11-14 Aixian Zhang , Keqin Feng

Maximum distance separable (MDS) and near maximum distance separable (NMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes due to their algebraic properties and excellent…

Information Theory · Computer Science 2024-12-16 Yujie Zhi , Shixin Zhu

A theoretical approach is proposed to calculate an effective dielectric constant of a matrix disperse system (MDS) of metallic particles (spheres) randomly distributed and embedded in a uniform dielectric medium. Deviations from the…

Soft Condensed Matter · Physics 2019-08-17 L. G. Grechko , K. W. Whites , V. N. Pustovit , V. S. Lysenko

In a multi-server system, how can one get better performance than random assignment of jobs to servers if queue-states cannot be queried by the dispatcher? A replication strategy has recently been proposed where $d$ copies of each arriving…

Performance · Computer Science 2019-12-10 Ken Duffy , Seva Shneer