Counting points on diagonal equations over Galois rings GR(p2,p2)

2019 ◽  
Vol 56 ◽  
pp. 266-284 ◽  
Author(s):  
Haiyan Zhou ◽  
Yao Sun
Keyword(s):  
Galois Rings ◽  
Counting Points

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 Sensor Location Problem for Network Traffic Flow Derivation Based on Turning Ratios at Intersection

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Minhua Shao ◽  
Lijun Sun ◽  
Xianzhi Shao
Keyword(s):  
Network Flow ◽  
Location Problem ◽  
Optimal Solution ◽  
Coefficient Matrix ◽  
Sensor Location ◽  
The Road ◽  
Minimum Number ◽  
Flow Conservation ◽  
The Greedy Algorithm ◽  
Counting Points

The sensor location problem (SLP) discussed in this paper is to find the minimum number and optimum locations of the flow counting points in the road network so that the traffic flows over the whole network can be inferred uniquely. Flow conservation system at intersections is formulated firstly using the turning ratios as the prior information. Then the coefficient matrix of the flow conservation system is proved to be nonsingular. Based on that, the minimal number of counting points is determined to be the total number of exclusive incoming roads and dummy roads, which are added to the network to represent the trips generated on real roads. So the task of SLP model based on turning ratios is just to determine the optimal sensor locations. The following analysis in this paper shows that placing sensors on all the exclusive incoming roads and dummy roads can always generate a unique network flow vector for any network topology. After that, a detection set composed of only real roads is proven to exist from the view of feasibility in reality. Finally, considering the roads importance and cost of the sensors, a weighted SLP model is formulated to find the optimal detection set. The greedy algorithm is proven to be able to provide the optimal solution for the proposed weighted SLP model.

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 Counting points of fixed degree and given height over function fields

2012 ◽  
Vol 45 (2) ◽  
pp. 283-300 ◽  
Author(s):  
Jeffrey Lin Thunder ◽  
Martin Widmer
Keyword(s):  
Function Fields ◽  
Fixed Degree ◽  
Counting Points

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

scholarly journals Improved Complexity Bounds for Counting Points on Hyperelliptic Curves

2018 ◽  
Vol 19 (3) ◽  
pp. 591-621 ◽  
Author(s):  
Simon Abelard ◽  
Pierrick Gaudry ◽  
Pierre-Jean Spaenlehauer
Keyword(s):  
Hyperelliptic Curves ◽  
Complexity Bounds ◽  
Counting Points
Sign in / Sign up

Export Citation Format

Share Document