activity
20072020
most citedA Rank-Metric Approach to Error Control in Random Network Coding

703 citations · 1.8k across the 23 of their papers we have counts for

collaborators

23 papers

cs.IT2020★ 1 cited

Iterative Error Decimation for Syndrome-Based Neural Network Decoders

Jorge Kysnney Santos Kamassury, Danilo Silva

In this letter, we introduce a new syndrome-based decoder where a deep neural network (DNN) estimates the error pattern from the reliability and syndrome of the received vector. Th…

cs.CL2020★ 10 cited

Predicting Multiple ICD-10 Codes from Brazilian-Portuguese Clinical Notes

Arthur D. Reys, Danilo Silva, Daniel Severo +3

ICD coding from electronic clinical records is a manual, time-consuming and expensive process. Code assignment is, however, an important task for billing purposes and database orga…

cs.IT2019★ 8 cited

Optimization of Integer-Forcing Precoding for Multi-User MIMO Downlink

Ricardo Bohaczuk Venturelli, Danilo Silva

Integer-forcing (IF) precoding is an alternative to linear precoding for multi-user (MU) multiple-input-multiple-output (MIMO) channels, with the potential to offer superior perfor…

eess.SP2019★ 18 cited

A Multistage Method for SCMA Codebook Design Based on MDS Codes

Bruno Fontana da Silva, Danilo Silva, Bartolomeu F. Uchôa-Filho +1

Sparse Code Multiple Access (SCMA) has been recently proposed for the future generation of wireless communication standards. SCMA system design involves specifying several paramete…

cs.IT2019★ 22 cited

Efficient Scheduling for the Massive Random Access Gaussian Channel

Gustavo Kasper Facenda, Danilo Silva

This paper investigates the massive random access Gaussian channel with a focus on small payloads. For this problem, grant-based schemes have been regarded as inefficient due to th…

cs.IT2017★ 15 cited

Multilevel LDPC Lattices with Efficient Encoding and Decoding and a Generalization of Construction D'

Paulo Ricardo Branco da Silva, Danilo Silva

Lattice codes are elegant and powerful structures that not only can achieve the capacity of the AWGN channel but are also a key ingredient to many multiterminal schemes that exploi…

cs.IT2017★ 2 cited

Low-Complexity Integer-Forcing Methods for Block Fading MIMO Multiple-Access Channels

Ricardo Bohaczuk Venturelli, Danilo Silva

Integer forcing is an alternative approach to conventional linear receivers for multiple-antenna systems. In an integer-forcing receiver, integer linear combinations of messages ar…

cs.IT2016★ 23 cited

On Integer-Forcing Precoding for the Gaussian MIMO Broadcast Channel

Danilo Silva, Gabriel Pivaro, Gustavo Fraidenraich +1

Integer-forcing (IF) precoding, also known as downlink IF, is a promising new approach for communication over multiple-input multiple-output (MIMO) broadcast channels. Inspired by…

cs.IT2013

On Multiplicative Matrix Channels over Finite Chain Rings

Roberto W. Nóbrega, Chen Feng, Danilo Silva +1

Motivated by physical-layer network coding, this paper considers communication in multiplicative matrix channels over finite chain rings. Such channels are defined by the law $Y =A…

cs.IT2013★ 20 cited

Communication over Finite-Chain-Ring Matrix Channels

Chen Feng, Roberto W. Nóbrega, Frank R. Kschischang +1

Though network coding is traditionally performed over finite fields, recent work on nested-lattice-based network coding suggests that, by allowing network coding over certain finit…

cs.IT2011

Algebraic Approach to Physical-Layer Network Coding

Chen Feng, Danilo Silva, Frank R. Kschischang

The problem of designing physical-layer network coding (PNC) schemes via nested lattices is considered. Building on the compute-and-forward (C&F) relaying strategy of Nazer and Gas…

cs.IT2011★ 5 cited

On the Capacity of Multiplicative Finite-Field Matrix Channels

Roberto W. Nóbrega, Danilo Silva, Bartolomeu F. Uchôa-Filho

This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplic…

cs.IT2010★ 234 cited

An Algebraic Approach to Physical-Layer Network Coding

Chen Feng, Danilo Silva, Frank R. Kschischang

The problem of designing new physical-layer network coding (PNC) schemes via lattice partitions is considered. Building on a recent work by Nazer and Gastpar, who demonstrated its…

cs.IT2010★ 14 cited

Universal Secure Error-Correcting Schemes for Network Coding

Danilo Silva, Frank R. Kschischang

This paper considers the problem of securing a linear network coding system against an adversary that is both an eavesdropper and a jammer. The network is assumed to transport n pa…

cs.NI2010★ 21 cited

Network Codes Resilient to Jamming and Eavesdropping

Hongyi Yao, Danilo Silva, Sidharth Jaggi +1

We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious errors. We pr…

cs.IT2009★ 103 cited

Sparse Network Coding with Overlapping Classes

Danilo Silva, Weifei Zeng, Frank R. Kschischang

This paper presents a novel approach to network coding for distribution of large files. Instead of the usual approach of splitting packets into disjoint classes (also known as gene…

cs.IT2009★ 44 cited

Fast Encoding and Decoding of Gabidulin Codes

Danilo Silva, Frank R. Kschischang

Gabidulin codes are the rank-metric analogs of Reed-Solomon codes and have a major role in practical error control for network coding. This paper presents new encoding and decoding…

cs.IT2008★ 17 cited

Robust Network Coding in the Presence of Untrusted Nodes

Da Wang, Danilo Silva, Frank R. Kschischang

While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to "pollution attacks," as the injection of even a single erroneou…

cs.IT2008★ 189 cited

Universal Secure Network Coding via Rank-Metric Codes

Danilo Silva, Frank R. Kschischang

The problem of securing a network coding communication system against an eavesdropper adversary is considered. The network implements linear network coding to deliver n packets fro…

cs.IT2008★ 68 cited

Communication over Finite-Field Matrix Channels

Danilo Silva, Frank R. Kschischang, Ralf Kötter

This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplic…

cs.IT2008★ 169 cited

On Metrics for Error Correction in Network Coding

Danilo Silva, Frank R. Kschischang

The problem of error correction in both coherent and noncoherent network coding is considered under an adversarial model. For coherent network coding, where knowledge of the networ…

cs.IT2008★ 68 cited

Security for Wiretap Networks via Rank-Metric Codes

Danilo Silva, Frank R. Kschischang

The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver packets from…

cs.IT2007★ 703 cited

A Rank-Metric Approach to Error Control in Random Network Coding

Danilo Silva, Frank R. Kschischang, Ralf Kötter

The problem of error control in random linear network coding is addressed from a matrix perspective that is closely related to the subspace perspective of Kötter and Kschischang. A…