Iwan M. Duursma - Citegraph

Author Info

Name	Affiliation	Papers
IWAN M. DUURSMA	Department of Mathematics, University of Limoges, 123 Avenue Albert Thomas, 87060, Limoges Cedex, France	30
Collaborators	Citations	PageRank
32	279	26.85
Referers	Referees	References
507	393	227

Search Limit

100507

Publications (30 rows)

Collaborators (32 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Polar Codes’ Simplicity, Random Codes’ Durability	1	0.35	2021
Sparse and Balanced Reed-Solomon and Tamo-Barg Codes.	1	0.37	2019
Codes With Locality in the Rank and Subspace Metrics	0	0.34	2019
On The I/O Costs Of Some Repair Schemes For Full-Length Reed-Solomon Codes	0	0.34	2018
Polar Code Moderate Deviation: Recovering the Scaling Exponent.	0	0.34	2018
Rank metric codes and zeta functions.	0	0.34	2018
Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability.	0	0.34	2018
Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels.	0	0.34	2018
Repairing Reed-Solomon Codes With Multiple Erasures.	3	0.41	2018
Rank-Metric Codes with Local Recoverability	2	0.37	2017
Shortened regenerating codes	9	0.48	2015
Matrix Theory for Minimal Trellises.	0	0.34	2015
Distributed gabidulin codes for multiple-source network error correction	1	0.40	2014
Distributed reed-solomon codes for simple multiple access networks	8	0.65	2014
Using concatenated algebraic geometry codes in channel polarization.	1	0.37	2013
Delta sets for divisors supported in two points.	1	0.37	2012
Coset bounds for algebraic geometric codes	19	1.21	2010
Binomial moments for divisible self-dual codes	0	0.34	2010
A symmetric Roos bound for linear codes	9	0.77	2006
ElGamal type signature schemes for n-dimensional vector spaces.	0	0.34	2006
A group key agreement protocol from pairings	4	0.49	2005
Combinatorics of the Two-Variable Zeta Function	5	0.58	2003
Everywhere Ramified Towers of Global Function Fields	1	0.45	2003
Extremal weight enumerators and ultraspherical polynomials	9	1.12	2003
Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d	129	7.28	2003
Reed-Muller Codes on Complete Intersections	26	2.76	2001
On the Optimal Z4 Codes of Type II and Length 16	0	0.34	2000
A Riemann hypothesis analogue for self-dual codes.	7	2.32	1999
Monomial embeddings of the Klein curve	1	0.38	1999
Speeding up the Discrete Log Computation on Curves with Automorphisms	42	2.34	1999