Results 241 to 250 of about 391,951 (282)
, 2016 U ovom radu bavit ćemo se Gaussovim cijelim brojevima. Reći ćemo nešto općenito o tom skupu, definirat ćemo normu i navesti invertibilne elemente. Takoder ćemo reći nešto o djeljivosti u skupu Gaussovih cijelih brojeva gdje ćemo iskazat važan Teorem o ...
Petrić, Ines
core +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Perfect Gaussian Integer Sequences Embedding Pre-Given Gaussian Integers
IEEE Signal Processing Letters, 2019A pre-given Gaussian integer (GI) is a GI that is determined before a sequence is designed, and a sequence embedding a pre-given GI is a sequence that contains the GI as part of its components. In this letter, for an arbitrary pre-given GI, we present two constructions that produce perfect GI sequences (PGISs) embedding the pre-given GI with different ...
Fanxin Zeng +5 more
openaire +2 more sources
PELL’S EQUATIONS IN GAUSSIAN INTEGERS
JP Journal of Algebra, Number Theory and Applications, 2019Summary: From Hurwitz's approach of complex continued fractions, we build a complex theory of the Pell's equation. In this paper, we study the complex theory of the Pell's equation, \(x^2-Dy^2=2\), that is, finding its solutions in Gaussian integers, using Hurwitz complex continued fraction, hence, generalizing it to the Pell's equation \(x^2-Dy^2=2^n\)
Kharbuki, Algracia, Singh, Madan Mohan
openaire +2 more sources
Algorithms for Gaussian integer arithmetic
Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976In this paper new algorithms are given for Gaussian integer division and the calculation of the greatest common divisor of two Gaussian integers. Empirical tests show that the new gcd algorithm is up to 5.39 times as fast as a Euclidean algorithm using the new division algorithm.
Bob F. Caviness, George E. Collins
openaire +2 more sources
Complex Gaussian integers for “Gaussian graphics”
ACM SIGPLAN Notices, 1993Some recent computer languages incorporate rational numbers, complex numbers, and rational complex numbers. We extend these numeric facilities to deal properly with Gaussian integers ---i.e., complex numbers whose real and imaginary parts are both ordinary (rational) integers.
openaire +1 more source
IEEE Transactions on Information Theory, 1994
Summary: It is shown how block codes over Gaussian integers can be used for coding over two-dimensional signal space. We introduce a two-dimensional modular distance called Mannheim distance and propose using codes designed for this distance. Some simple constructions of such codes are given, among them icyclic codes which belong to the class of ...
openaire +3 more sources
Summary: It is shown how block codes over Gaussian integers can be used for coding over two-dimensional signal space. We introduce a two-dimensional modular distance called Mannheim distance and propose using codes designed for this distance. Some simple constructions of such codes are given, among them icyclic codes which belong to the class of ...
openaire +3 more sources
ARITHMETIC FUNCTIONS ON GAUSSIAN INTEGERS
International Journal of Number Theory, 2013In this paper we present a short study of the ring of complex-valued arithmetic functions defined on the ring of Gaussian integers. We investigate an absolute value and the corresponding metric structure on this ring.
Steinberger, Thomas +2 more
openaire +2 more sources
Relationship between Lucas Sequences and Gaussian Integers in Cryptosystems
, 2015 Both Gaussian integers and Lucas sequences have been applied in cryptography. This paper presents the mathematical relationship between Lucas sequences and Gaussian integers.
Aleksey Koval, Koval, Aleksey
exaly +2 more sources
2020 28th European Signal Processing Conference (EUSIPCO), 2021
In this paper we will discuss two construction schemes on arbitrary length perfect Gaussian integer sequence (PGIS) with a pre-given constant. The first scheme uses geometric series, which brings reducible PGIS. We will also discuss the irreducible case and find an easy way to obtain PGIS for even length.
Soo-Chang Pei, Kuo-Wei Chang
openaire +2 more sources
In this paper we will discuss two construction schemes on arbitrary length perfect Gaussian integer sequence (PGIS) with a pre-given constant. The first scheme uses geometric series, which brings reducible PGIS. We will also discuss the irreducible case and find an easy way to obtain PGIS for even length.
Soo-Chang Pei, Kuo-Wei Chang
openaire +2 more sources