On Binary Digit-Position Sequences over Galois Rings, Admitting an Effect of Reduction of Period

2017 ◽  
Vol 223 (5) ◽  
pp. 642-647
Author(s):  
S. A. Kuzmin
Keyword(s):  
Galois Rings ◽  
Binary Digit ◽  
Digit Position

scholarly journals Normal Bases on Galois Ring Extensions

Symmetry ◽  
2018 ◽  
Vol 10 (12) ◽  
pp. 702
Author(s):  
Aixian Zhang ◽  
Keqin Feng
Keyword(s):  
Signal Processing ◽  
Finite Field ◽  
Block Cipher ◽  
Field Extension ◽  
Galois Ring ◽  
Normal Basis ◽  
Galois Rings ◽  
Ring Extension ◽  
Galois Fields ◽  
Normal Bases

Normal bases are widely used in applications of Galois fields and Galois rings in areas such as coding, encryption symmetric algorithms (block cipher), signal processing, and so on. In this paper, we study the normal bases for Galois ring extension R / Z p r , where R = GR ( p r , n ) . We present a criterion on the normal basis for R / Z p r and reduce this problem to one of finite field extension R ¯ / Z ¯ p r = F q / F p ( q = p n ) by Theorem 1. We determine all optimal normal bases for Galois ring extension.

scholarly journals New Partial Difference Sets in Ztp2 and a Related Problem about Galois Rings

2001 ◽  
Vol 7 (1) ◽  
pp. 165-188 ◽  
Author(s):  
Xiang-Dong Hou ◽  
Ka Hin Leung ◽  
Qing Xiang
Keyword(s):  
Related Problem ◽  
Difference Sets ◽  
Galois Rings ◽  
Partial Difference ◽  
Partial Difference Sets

scholarly journals Construction of MDS self-dual codes over Galois rings

2007 ◽  
Vol 45 (2) ◽  
pp. 247-258 ◽  
Author(s):  
Jon-Lark Kim ◽  
Yoonjin Lee
Keyword(s):  
Galois Rings ◽  
Dual Codes

scholarly journals Amorphous Association Schemes over the Galois Rings of Characteristic 4

1991 ◽  
Vol 12 (6) ◽  
pp. 513-526 ◽  
Author(s):  
Tatsuro Ito ◽  
Akihiro Munemasa ◽  
Mieko Yamada
Keyword(s):  
Association Schemes ◽  
Galois Rings

Manufacturing and Fractional Cell Formation Using a New Binary Digit Grouping Algorithm with a Pwavroid Solution Explorer Toolkit

2014 ◽  
Vol 933 ◽  
pp. 97-105
Author(s):  
Hassan Mroue ◽  
Thien My Dao
Keyword(s):  
Group Technology ◽  
Cell Formation ◽  
Optimal Solution ◽  
Binary Digit ◽  
Final Solution ◽  
Manufacturing Cells ◽  
Additional Cell ◽  
Exceptional Elements ◽  
Grouping Algorithm ◽  
Fractional Cell

A new algorithm is presented in order to search for the optimal solution of the manufacturing and fractional cell formation problem. In addition, this paper introduces a new toolkit, which is used to search for the various candidate solutions in a periodic and a waving (diversified) manner. The toolkit consists of 15 tools that play a major role in speeding up the obtainment of the final solution as well as in increasing its efficiency. The application of the binary digit grouping algorithm leads to the creation of manufacturing cells according to the concept of group technology. The nonzero entries, which remain outside the manufacturing cells, are called exceptional elements. When a lot of such elements is obtained, an additional cell called fractional (or remainder) cell may be formed; the aim of which is to reduce their number. This algorithm was tested by using illustrative examples taken from the literature and succeeded to give better or at least similar results when compared to those of other well-known algorithms.

Digit Position and Force Synergies During Unconstrained Grasping

2016 ◽  
pp. 29-40 ◽  
Author(s):  
Abdeldjallil Naceri ◽  
Marco Santello ◽  
Alessandro Moscatelli ◽  
Marc O. Ernst
Keyword(s):  
Digit Position

scholarly journals An Upper Bound for the Extended Kloosterman Sums over Galois Rings

1998 ◽  
Vol 4 (3) ◽  
pp. 218-238 ◽  
Author(s):  
Abhijit G. Shanbhag ◽  
P. Vijay Kumar ◽  
Tor Helleseth
Keyword(s):  
Upper Bound ◽  
Kloosterman Sums ◽  
Galois Rings
Sign in / Sign up

Export Citation Format

Share Document