Fast reliability ranking of matchstick minimal networks von Drǎgoi, Vlad‐Florin, Beiu, Valeriu

Volltext

Bhattacharyya Parameter of Monomial Codes for the Binary Erasure Channel: From Pointwise to Average Reliability von Dragoi, Vlad-Florin, Cristescu, Gabriela

Volltext

Reliability polynomials of consecutive‐k‐out‐of‐n:F systems have unbounded roots von Jianu, Marilena, Dăuş, Leonard, Drăgoi, Vlad‐Florin, Beiu, Valeriu

Volltext

Efficient Approximation of Two-Terminal Networks Reliability Polynomials Using Cubic Splines von Cristescu, Gabriela, Dragoi, Vlad-Florin

Volltext

Four Input Sorter Good, Larger Ones Not So Good von Dragoi, Vlad-Florin, Cowell, Simon, Beiu, Valeriu

Volltext

Profiled Side-Channel Attack on Cryptosystems Based on the Binary Syndrome Decoding Problem von Colombier, Brice, Dragoi, Vlad-Florin, Cayrel, Pierre-Louis, Grosso, Vincent

Volltext

The Roots of the Reliability Polynomials of Circular Consecutive-k-out-of-n:F Systems von Jianu, Marilena, Dăuş, Leonard, Drăgoi, Vlad-Florin, Beiu, Valeriu

Volltext

Integer syndrome decoding in the presence of noise von Drăgoi, Vlad-Florin, Colombier, Brice, Cayrel, Pierre-Louis, Grosso, Vincent

Volltext

On the Closed-Form Weight Enumeration of Polar Codes: 1.5 d -Weight Codewords von Drăgoi, Vlad-Florin, Rowshan, Mohammad, Yuan, Jinhong

Volltext

Punctured Syndrome Decoding Problem: Efficient Side-Channel Attacks Against Classic McEliece von Grosso, Vincent, Cayrel, Pierre-Louis, Colombier, Brice, Drăgoi, Vlad-Florin

Volltext

Generalized Convexity Properties and Shape-Based Approximation in Networks Reliability von Cristescu, Gabriela, Dragoi, Vlad-Florin, Hoara, Sorin Horatiu

Volltext

Which Coefficients Matter Most-Consecutive k-Out-of- n: F Systems Revisited von Dragoi, Vlad-Florin, Beiu, Valeriu

Volltext

Message-Recovery Laser Fault Injection Attack on the Classic McEliece Cryptosystem von Cayrel, Pierre-Louis, Colombier, Brice, Drăgoi, Vlad-Florin, Menu, Alexandre, Bossuet, Lilian

Volltext

Tight Bounds on the Coefficients of Consecutive k-out-of-n:F Systems von Drăgoi, Vlad-Florin, Cowell, Simon, Beiu, Valeriu

Volltext

On Recursively Defined Combinatorial Classes and Labelled Trees von Chouria, Ali, Drăgoi, Vlad-Florin, Luque, Jean-Gabriel

Volltext

Solving a Modified Syndrome Decoding Problem using Integer Programming von Dragoi, V-F, Cayrel, P-L, Colombier, B., Bucerzan, D., Hoara, S.

Volltext

Structural Properties of Self-dual Monomial Codes with Application to Code-Based Cryptography von Drăgoi, Vlad-Florin, Szocs, Andreea

Volltext

A Side-Channel Attack Against Classic McEliece When Loading the Goppa Polynomial von Seck, Boly, Cayrel, Pierre-Louis, Dragoi, Vlad-Florin, Diop, Idy, Barbier, Morgan, Klamti, Jean Belo, Grosso, Vincent, Colombier, Brice

Volltext

On Posets for Reliability: How Fine Can They Be? von Beiu, Valeriu, Cowell, Simon R., Drăgoi, Vlad-Florin

Volltext

Key-Recovery by Side-Channel Information on the Matrix-Vector Product in Code-Based Cryptosystems von Seck, Boly, Cayrel, Pierre-Louis, Diop, Idy, Dragoi, Vlad-Florin, Couzon, Kalen, Colombier, Brice, Grosso, Vincent

Volltext