Keyword : finite fields


Deterministic Constructions of Compressed Sensing Matrices Based on Affine Singular Linear Space over Finite Fields
Gang WANG Min-Yao NIU Jian GAO Fang-Wei FU 
Publication:   
Publication Date: 2018/11/01
Vol. E101-A  No. 11 ; pp. 1957-1963
Type of Manuscript:  LETTER
Category: Coding Theory
Keyword: 
compressed sensingcoherencesparsityaffine singular linear spacefinite fields
 Summary | Full Text:PDF(199.1KB)

Performance Evaluation of Finite Sparse Signals for Compressed Sensing Frameworks
Jin-Taek SEONG 
Publication:   
Publication Date: 2018/02/01
Vol. E101-D  No. 2 ; pp. 531-534
Type of Manuscript:  LETTER
Category: Fundamentals of Information Systems
Keyword: 
compressed sensingfinite fieldssignal recoveryprobabilistic decoding
 Summary | Full Text:PDF(156.8KB)

Linear Complexity of Pseudorandom Sequences Derived from Polynomial Quotients: General Cases
Xiaoni DU Ji ZHANG Chenhuang WU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/04/01
Vol. E97-A  No. 4 ; pp. 970-974
Type of Manuscript:  PAPER
Category: Information Theory
Keyword: 
cryptographypseudorandom binary sequencespolynomial quotientsfinite fieldslinear complexity
 Summary | Full Text:PDF(667.8KB)

3-Way Software Testing with Budget Constraints
Soumen MAITY 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2012/09/01
Vol. E95-D  No. 9 ; pp. 2227-2231
Type of Manuscript:  Special Section LETTER (Special Section on Software Reliability Engineering)
Category: 
Keyword: 
covering arraystest case generationfinite fieldslinear group
 Summary | Full Text:PDF(292.6KB)

Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus
Chenhuang WU Zhixiong CHEN Xiaoni DU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2012/07/01
Vol. E95-A  No. 7 ; pp. 1197-1199
Type of Manuscript:  LETTER
Category: Information Theory
Keyword: 
Fermat quotientsCarmichael quotientsfinite fieldsbinary threshold sequenceslinear complexity
 Summary | Full Text:PDF(75.5KB)

Low Complexity Encoding Based on Richardson's LDPC Codes
Hyunseuk YOO Chang Hui CHOE Moon Ho LEE 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 2007/08/01
Vol. E90-B  No. 8 ; pp. 2151-2154
Type of Manuscript:  LETTER
Category: Fundamental Theories for Communications
Keyword: 
finite fieldscirculant permutation matricesRichardson's encoding schemecomputational complexity
 Summary | Full Text:PDF(192.9KB)

Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF (2m)
Chiou-Yng LEE Che-Wun CHIOU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/11/01
Vol. E88-A  No. 11 ; pp. 3169-3179
Type of Manuscript:  PAPER
Category: Circuit Theory
Keyword: 
finite fieldsbit-parallel systolic multiplierHankel matrixdual basisnormal basis
 Summary | Full Text:PDF(534KB)

An Efficient Square Root Computation in Finite Fields GF(p2d)
Feng WANG Yasuyuki NOGAMI Yoshitaka MORIKAWA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/10/01
Vol. E88-A  No. 10 ; pp. 2792-2799
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Cryptography and Information Security
Keyword: 
square rootfinite fieldsquadratic residue
 Summary | Full Text:PDF(211.2KB)

Low Complexity Multiplexer-Based Parallel Multiplier of GF(2m)
Gi-Young BYUN Heung-Soo KIM 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/12/01
Vol. E86-D  No. 12 ; pp. 2684-2690
Type of Manuscript:  PAPER
Category: Computer System Element
Keyword: 
finite fieldsMUX-based multiplierall one polynomials (AOP)standard basiscircuit complexity
 Summary | Full Text:PDF(879.5KB)

A Derivation of the Phase Difference between n-Tuples of an M-Sequence by Arithmetic a Finite Field
Tsutomu MORIUCHI Kyoki IMAMURA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/10/25
Vol. E76-A  No. 10 ; pp. 1874-1876
Type of Manuscript:  LETTER
Category: Information Theory and Coding Theory
Keyword: 
m-sequencesbinaty sequencespseudo-random sequencesphase difference between n-tuplesfinite fields
 Summary | Full Text:PDF(147.1KB)