5 papers · 1 filter
A Novel Formula for Solving Quadratic Equations over Binary Extension Fields
Leilei Yu, Yunghsiang S. Han, Pingping Li +1
Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomi…
The Construction of Near-optimal Universal Coding of Integers
Wei Yan, Yunghsiang S. Han
The Universal Coding of Integers~(UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. A UCI is a class…
A Fast Decoding Algorithm for Generalized Reed-Solomon Codes and Alternant Codes
Nianqi Tang, Yunghsiang S. Han, Danyang Pei +1
In this paper, it is shown that the syndromes of generalized Reed-Solomon (GRS) codes and alternant codes can be characterized in terms of inverse fast Fourier transform, regardles…
New EVENODD+ Codes with More Flexible Parameters and Lower Complexity
Panyu Zhu
EVENODD+ codes are binary maximum distance separable (MDS) array codes for correcting double disk failures in RAID-6 with asymptotically optimal encoding/decoding/update complexiti…
Generalized Universal Coding of Integers
Wei Yan, Sian-Jheng Lin, Yunghsiang S. Han
Universal coding of integers~(UCI) is a class of variable-length code, such that the ratio of the expected codeword length to is within a constant factor, where $H…