Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Alberto Ravagnani"'
Autor:
Alberto Ravagnani
Publikováno v:
Le Matematiche, Vol 69, Iss 1, Pp 275-284 (2014)
In this paper non-trivial non-linear binary systematic AMDS codes are classified in terms of their weight distributions, employing only elementary techniques. In particular, we show that their length and minimum distance completely determine the weig
Externí odkaz:
https://doaj.org/article/ca37502b76aa45719cec033e13bd3460
Autor:
Alberto Ravagnani, Edoardo Ballico
Publikováno v:
Le Matematiche, Vol 68, Iss 2, Pp 91-98 (2013)
In this paper we study the projective normality of certain Artin-Schreier curves Y_f defined over a field F of characteristic p by the equations y^q+y=f(x), q being a power of p and f in F[x] being a polynomial in x of degree m, with (m,p)=1. Many Y_
Externí odkaz:
https://doaj.org/article/03d4ab4846564b5c8df5b57f0b04c019
Publikováno v:
IEEE Transactions on Information Theory, 69(6):10034808, 3708-3730. Institute of Electrical and Electronics Engineers
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 an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a16324b15c3c2b14f975114bd5cbca53
https://research.tue.nl/nl/publications/ef6b1ca4-b655-423b-b757-a9259493445b
https://research.tue.nl/nl/publications/ef6b1ca4-b655-423b-b757-a9259493445b
Autor:
Giuseppe Cotardo, Alberto Ravagnani
Publikováno v:
IEEE Transactions on Information Theory, 68(5), 2941-2950. Institute of Electrical and Electronics Engineers
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. In turn, these lead to two new fundamental parameters of bi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8611814d54d26221c290e21213a17daa
http://www.scopus.com/inward/record.url?scp=85124093678&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85124093678&partnerID=8YFLogxK
Publikováno v:
IFAC-PapersOnLine. 55(30):236-241
We initiate the study of the one-shot capacity of communication (coded) networks with an adversary having access only to a proper subset of the network edges. We introduce the Diamond Network as a minimal example to show that known cut-set bounds are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb54efd54f79164ebb09b3204ab75352
https://doi.org/10.1016/j.ifacol.2022.11.058
https://doi.org/10.1016/j.ifacol.2022.11.058
Publikováno v:
Linear Algebra and Its Applications, 604, 92-128. Elsevier
In this paper we introduce a new class of extremal codes, namely the $i$-BMD codes. We show that for this family several of the invariants are determined by the parameters of the underlying code. We refine and extend the notion of an $i$-MRD code and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24806382280d301d49c2af19579e6380
https://research.tue.nl/en/publications/198199c6-5563-47ff-88ea-9e041c796280
https://research.tue.nl/en/publications/198199c6-5563-47ff-88ea-9e041c796280
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 t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d19f2ca2d57df89dd999d534c798099e
http://arxiv.org/abs/2201.07503
http://arxiv.org/abs/2201.07503
We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including (sub)linear and nonlinear codes. We focus on the general setting of finite translation-invariant metric spaces, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b43b459bc5db4f144ec85a13aa66e735
Publikováno v:
IEEE Transactions on Information Theory, 67(10), 6456-6475. Institute of Electrical and Electronics Engineers
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-ra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4b23b3429bd380daf914dfd77c72b4d
https://research.tue.nl/nl/publications/ca428d31-a38a-420b-a683-7b0bf6d712b7
https://research.tue.nl/nl/publications/ca428d31-a38a-420b-a683-7b0bf6d712b7
Publikováno v:
Journal of Combinatorial Theory, Series A, 192:105658. Academic Press Inc.
This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the q-analogues of projective systems and blocking sets. We also illustrate how to associate a classical Hamming-metric code to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7896fae0519487452f91d4797c9fb112
http://arxiv.org/abs/2106.12465
http://arxiv.org/abs/2106.12465