arXiv subjects

Varsha Chauhan

Publications and source records attributed to Varsha Chauhan.

3 recordsLinked to original sources

arXiv2025

Some remarks on the results derived by Ramy Takieldin and Patrick Solé (2025)

The purpose of this note is to rectify a typographical error in the statements of Theorems 5.5 and 5.6 of Sharma, Chauhan and Singh[3] and further analyze and discuss the significance of the results derived in Takieldin and Solé [4]. In our opinion, several claims made by the authors in [4] are either factually incorrect or lack adequate substantiation, which may confuse the readers about the contributions of [1,3]. Our remarks on the work [4] intend to provide the clarity and inform about the true contributions and findings of our research.

cs.IT↗

arXiv2019

Multiscale Planar Graph Generation

The study of network representations of physical, biological, and social phenomena can help us better understand the structural and functional dynamics of their networks and formulate predictive models of these phenomena. However, due to the scarcity of real-world network data owing to factors such as cost and effort required in collection of network data and the sensitivity of this data towards theft and misuse, engineers and researchers often rely on synthetic data for simulations, hypothesis testing, decision making, and algorithm engineering. An important characteristic of infrastructure networks such as roads, water distribution and other utility systems is that they can be embedded in a plane, therefore to simulate these system we need realistic networks which are also planar. While the currently-available synthetic network generators can model networks that exhibit realism, they do not guarantee or achieve planarity. Therefore, in this paper we present a flexible algorithm that can synthesize realistic networks that are planar. The method follows a multi-scale randomized editing approach generating a hierarchy of coarsened networks of a given planar graph and introducing edits at various levels in the hierarchy. The method preserves the structural properties with minimal bias including the planarity of the network, while introducing realistic variability at multiple scales.

cs.SI↗

arXiv2017

Multi-twisted codes over finite fields and their dual codes

Let $\mathbb{F}_{q}$ denote the finite field of order $q,$ let $m_1,m_2,\cdots,m_{\ell}$ be positive integers satisfying $\gcd(m_i,q)=1$ for $1 \leq i \leq \ell,$ and let $n=m_1+m_2+\cdots+m_{\ell}.$ Let $Λ=(λ_1,λ_2,\cdots,λ_{\ell})$ be fixed, where $λ_1,λ_2,\cdots,λ_{\ell}$ are non-zero elements of $\mathbb{F}_{q}.$ In this paper, we study the algebraic structure of $Λ$-multi-twisted codes of length $n$ over $\mathbb{F}_{q}$ and their dual codes with respect to the standard inner product on $\mathbb{F}_{q}^n.$ We provide necessary and sufficient conditions for the existence of a self-dual $Λ$-multi-twisted code of length $n$ over $\mathbb{F}_{q},$ and obtain enumeration formulae for all self-dual and self-orthogonal $Λ$-multi-twisted codes of length $n$ over $\mathbb{F}_{q}.$ We also derive some sufficient conditions under which a $Λ$-multi-twisted code is LCD. We determine the parity-check polynomial of all $Λ$-multi-twisted codes of length $n$ over $\mathbb{F}_{q}$ and obtain a BCH type bound on their minimum Hamming distances. We also determine generating sets of dual codes of some $Λ$-multi-twisted codes of length $n$ over $\mathbb{F}_{q}$ from the generating sets of the codes. Besides this, we provide a trace description for all $Λ$-multi-twisted codes of length $n$ over $\mathbb{F}_{q}$ by viewing these codes as direct sums of certain concatenated codes, which leads to a method to construct these codes. We also obtain a lower bound on their minimum Hamming distances using their multilevel concatenated structure.

math.AC↗