EDBT 2026 Demo / reviewers in the wild / expert
Vidya Sagar
dblp:79/5242
· DBLP profile ↗
5ranked-venue papers
3as first author
3since 2021 · last 2026
0000-0003-0174-2447ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorComputer networks · 1Theory of computation · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › codes over rings
linear codes over rings |
0.8 | 1 | 2024 | Codes Over the Non-Unital Non-Commutative Ring E Using Simplicial Complexes · IEEE Trans. Inf. Theory 2024 |
Coding theory › error-correcting codes › q-ary codes
binary codes |
0.2 | 1 | 2024 | Codes Over the Non-Unital Non-Commutative Ring E Using Simplicial Complexes · IEEE Trans. Inf. Theory 2024 |
Coding theory
gray map |
0.2 | 1 | 2024 | Codes Over the Non-Unital Non-Commutative Ring E Using Simplicial Complexes · IEEE Trans. Inf. Theory 2024 |
Coding theory › error-correcting codes › coding bounds › linear code bounds
griesmer bound |
0.2 | 1 | 2024 | Codes Over the Non-Unital Non-Commutative Ring E Using Simplicial Complexes · IEEE Trans. Inf. Theory 2024 |
Coding theory › error-correcting codes
optimal codes |
0.2 | 1 | 2024 | Codes Over the Non-Unital Non-Commutative Ring E Using Simplicial Complexes · IEEE Trans. Inf. Theory 2024 |
Methods — techniques the papers use, named apart from their topics
weight distribution · 0.8simplicial complexes · 0.8gray map · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Determining the exact value of the second-order generalized covering radius of two classes of binary cyclic codes
Zhengchun Zhou, Sihem Mesnager, Vidya Sagar, Haode Yan |
Des. Codes Cryptogr. | 4 |
| 2024 | Minimal and optimal binary codes obtained using CD-construction over the non-unital ring I
Vidya Sagar, Ritumoni Sarma |
Des. Codes Cryptogr. | 1 |
| 2024 | Codes Over the Non-Unital Non-Commutative Ring E Using Simplicial ComplexesabstractThere are exactly two non-commutative rings of size 4, namely,$E = \langle a, b \vert 2a = 2b = 0, a^{2} = a, b^{2} = b, ab= a, ba = b\rangle $and its opposite ring$F$. These rings are non-unital. A subset$D$of$E^{m}$is defined with the help of simplicial complexes, and utilized to construct the linear left-$E$-code$C^{L}_{D}=\{(v\cdot d)_{d\in D}: v\in E^{m}\}$and the right-$E$-code$C^{R}_{D}=\{(d\cdot v)_{d\in D}: v\in E^{m}\}$. We study a certain binary subfield-like code corresponding to$C_{D}^{L}$. By using a Gray map, we also obtain the binary Gray images of$C_{D}^{L}$and$C_{D}^{R}$. The weight distributions of all these codes are computed. We achieve a couple of infinite families of optimal codes with respect to the Griesmer bound. Ashikhmin-Barg’s condition for minimality of a linear code is satisfied by most of the binary codes we constructed here. All the binary codes in this article are self-orthogonal and few-weight codes under certain mild conditions. This is the first attempt to study the structure of linear codes over a non-unital non-commutative ring using simplicial complexes. Vidya Sagar, Ritumoni Sarma |
IEEE Trans. Inf. Theory | 1 |
| 2015 | Cloud offloading for multi-radio enabled mobile devicesabstractThe advent of 5G networking technologies has increased the expectations from mobile devices, in that, more sophisticated, computationally intense applications are expected to be delivered on the mobile device which are themselves getting smaller and sleeker. This predicates a need for offloading computationally intense parts of the applications to a resource strong cloud. Parallely, in the wireless networking world, the trend has shifted to multi-radio (as opposed to multi-channel) enabled communications. In this paper, we provide a comprehensive computation offloading solution that uses the multiple radio links available for associated data transfer, optimally. Our contributions include: a comprehensive model for the energy consumption from the perspective of the mobile device; the formulation of the joint optimization problem to minimize the energy consumed as well as allocating the associated data transfer optimally through the available radio links and an iterative algorithm that converges to a locally optimal solution. Simulations on an HTC phone, running a 14-component application and using the Amazon EC2 as the cloud, show that the solution obtained through the iterative algorithm consumes only 3% more energy than the optimal solution (obtained via exhaustive search). S. Eman Mahmoodi, K. P. Subbalakshmi, Vidya Sagar |
ICC | 3 |
| 1994 | Block-parallel decoding of convolutional codes using neural network decoders
Vidya Sagar, Garry M. Jacyna, Harold Szu |
Neurocomputing | 1 |