scholarly journals Some Nonexistence and Asymptotic Existence Results for Weighing Matrices

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Ebrahim Ghaderpour
Keyword(s):  
Positive Integer ◽  
Coding Theory ◽  
Wireless Networking ◽  
Existence Results ◽  
Weighing Matrices ◽  
Orthogonal Designs

Orthogonal designs and weighing matrices have many applications in areas such as coding theory, cryptography, wireless networking, and communication. In this paper, we first show that if positive integer k cannot be written as the sum of three integer squares, then there does not exist any skew-symmetric weighing matrix of order 4n and weight k, where n is an odd positive integer. Then we show that, for any square k, there is an integer N(k) such that, for each n≥N(k), there is a symmetric weighing matrix of order n and weight k. Moreover, we improve some of the asymptotic existence results for weighing matrices obtained by Eades, Geramita, and Seberry.

Several classes of permutation trinomials from Niho exponents over finite fields of characteristic 3

2019 ◽  
Vol 18 (04) ◽  
pp. 1950069
Author(s):  
Qian Liu ◽  
Yujuan Sun
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Coding Theory ◽  
Permutation Polynomials ◽  
Combinatorial Designs ◽  
Dickson Polynomial ◽  
Niho Exponents ◽  
Characteristic 3 ◽  
Permutation Trinomials ◽  
Algebraic Forms

Permutation polynomials have important applications in cryptography, coding theory, combinatorial designs, and other areas of mathematics and engineering. Finding new classes of permutation polynomials is therefore an interesting subject of study. Permutation trinomials attract people’s interest due to their simple algebraic forms and additional extraordinary properties. In this paper, based on a seventh-degree and a fifth-degree Dickson polynomial over the finite field [Formula: see text], two conjectures on permutation trinomials over [Formula: see text] presented recently by Li–Qu–Li–Fu are partially settled, where [Formula: see text] is a positive integer.

scholarly journals Short Amicable sets and Kharaghani type orthogonal designs

2001 ◽  
Vol 64 (3) ◽  
pp. 495-504 ◽  
Author(s):  
Christos Koukouvinos ◽  
Jennifer Seberry
Keyword(s):  
Hadamard Matrices ◽  
Weighing Matrices ◽  
Orthogonal Designs

Dedicated to Professor George SzekeresShort amicable sets were introduced recently and have many applications. The construction of short amicable sets has lead to the construction of many orthogonal designs, weighing matrices and Hadamard matrices. In this paper we give some constructions for short amicable sets as well as some multiplication theorems. We also present a table of the short amicable sets known to exist and we construct some infinite families of short amicable sets and orthogonal designs.

scholarly journals Applying Balanced Generalized Weighing Matrices to Construct Block Designs

10.37236/1556 ◽  
2001 ◽  
Vol 8 (1) ◽  
Author(s):  
Yury J. Ionin
Keyword(s):  
Positive Integer ◽  
Prime Power ◽  
Block Designs ◽  
Weighing Matrices ◽  
Symmetric Designs

Balanced generalized weighing matrices are applied for constructing a family of symmetric designs with parameters $(1+qr(r^{m+1}-1)/(r-1),r^{m},r^{m-1}(r-1)/q)$, where $m$ is any positive integer and $q$ and $r=(q^{d}-1)/(q-1)$ are prime powers, and a family of non-embeddable quasi-residual $2-((r+1)(r^{m+1}-1)/(r-1),r^{m}(r+1)/2,r^{m}(r-1)/2)$ designs, where $m$ is any positive integer and $r=2^{d}-1$, $3\cdot 2^{d}-1$ or $5\cdot 2^{d}-1$ is a prime power, $r\geq 11$.

scholarly journals On Third-Order Nonlinearity of Biquadratic Monomial Boolean Functions

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Brajesh Kumar Singh
Keyword(s):  
Lower Bound ◽  
Positive Integer ◽  
Boolean Function ◽  
Lower Bounds ◽  
Boolean Functions ◽  
Coding Theory ◽  
Block Ciphers ◽  
Covering Radius ◽  
Third Order ◽  
Complicated Problem

The rth-order nonlinearity of Boolean function plays a central role against several known attacks on stream and block ciphers. Because of the fact that its maximum equals the covering radius of the rth-order Reed-Muller code, it also plays an important role in coding theory. The computation of exact value or high lower bound on the rth-order nonlinearity of a Boolean function is very complicated problem, especially when r>1. This paper is concerned with the computation of the lower bounds for third-order nonlinearities of two classes of Boolean functions of the form Tr1nλxd for all x∈𝔽2n, λ∈𝔽2n*, where a d=2i+2j+2k+1, where i, j, and   k are integers such that i>j>k≥1 and n>2i, and b d=23ℓ+22ℓ+2ℓ+1, where ℓ is a positive integer such that gcdℓ,𝓃=1 and n>6.

scholarly journals Nonexistence Results for Hadamard-like Matrices

10.37236/1842 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Justin D. Christian ◽  
Bryan L. Shader
Keyword(s):  
Positive Integer ◽  
Weighing Matrices

The class of square $(0,1,-1)$-matrices whose rows are nonzero and mutually orthogonal is studied. This class generalizes the classes of Hadamard and Weighing matrices. We prove that if there exists an $n$ by $n$ $(0,1,-1)$-matrix whose rows are nonzero, mutually orthogonal and whose first row has no zeros, then $n$ is not of the form $p^k$, $2p^k$ or $3p$ where $p$ is an odd prime, and $k$ is a positive integer.

scholarly journals On the structure and existence of some amicable orthogonal designs

1978 ◽  
Vol 25 (1) ◽  
pp. 118-128 ◽  
Author(s):  
Peter J. Robinson ◽  
Jennifer Seberry
Keyword(s):  
Weighing Matrices ◽  
Orthogonal Designs

AbstractThe structure is determined for the existence of some amicable weighing matrices. This is then used to prove the existence and non-existence of some amicable orthogonal designs in powers of two.

scholarly journals New classes of graphs with edge $ \; \delta- $ graceful labeling

2022 ◽  
Vol 7 (3) ◽  
pp. 3554-3589
Author(s):  
Mohamed R. Zeen El Deen ◽  
◽  
Ghada Elmahdy ◽  
Keyword(s):  
Positive Integer ◽  
Mathematical Models ◽  
Communication Networks ◽  
Data Security ◽  
Coding Theory ◽  
Graph Labeling ◽  
Graceful Labeling ◽  
Extensive Range ◽  
Fan Graph ◽  
Positive Integers

<abstract><p>Graph labeling is a source of valuable mathematical models for an extensive range of applications in technologies (communication networks, cryptography, astronomy, data security, various coding theory problems). An edge $ \; \delta - $ graceful labeling of a graph $ G $ with $ p\; $ vertices and $ q\; $ edges, for any positive integer $ \; \delta $, is a bijective $ \; f\; $ from the set of edge $ \; E(G)\; $ to the set of positive integers $ \; \{ \delta, \; 2 \delta, \; 3 \delta, \; \cdots\; , \; q\delta\; \} $ such that all the vertex labels $ \; f^{\ast} [V(G)] $, given by: $ f^{\ast}(u) = (\sum\nolimits_{uv \in E(G)} f(uv)\; )\; mod\; (\delta \; k) $, where $ k = max (p, q) $, are pairwise distinct. In this paper, we show the existence of an edge $ \; \delta- $ graceful labeling, for any positive integer $ \; \delta $, for the following graphs: the splitting graphs of the cycle, fan, and crown, the shadow graphs of the path, cycle, and fan graph, the middle graphs and the total graphs of the path, cycle, and crown. Finally, we display the existence of an edge $ \; \delta- $ graceful labeling, for the twig and snail graphs.</p></abstract>

scholarly journals A note on asymptotic existence results for orthogonal designs

1977 ◽  
pp. 76-90
Author(s):  
Peter Eades ◽  
Jennifer Seberry Wallis ◽  
Nicholas Wormald
Keyword(s):  
Existence Results ◽  
Orthogonal Designs
Sign in / Sign up

Export Citation Format

Share Document