N-dimensional uniform probability distribution in nonlinear autoregressive filter structures

A new construction of authentication codes with arbitration and multireceiver from singular symplectic geometry over finite fields is given. The parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of deception are also computed.

Download Full-text

Finite Dimensional Approximations to Some Flows on the Projective Limit Space of Spheres

Nagoya Mathematical Journal ◽

10.1017/s0027763000024004 ◽

1966 ◽

Vol 28 ◽

pp. 167-177

Author(s):

Hisao Nomoto

Keyword(s):

Probability Distribution ◽

Probability Space ◽

Essential Role ◽

Projective Limit ◽

Dimensional Sphere ◽

Basic Space ◽

Limit Space ◽

Finite Dimensional ◽

Uniform Probability ◽

Uniform Probability Distribution

Let Ω be the projective limit space of a sequence of probability space Ωn which is a certain subset of (n − 1)-dimensional sphere with the usual uniform probability distribution on it. T. Hida [2], starting from a sequence of finite dimensional flows which are derived from some one-parameter subgroups of rotations of spheres, constructed a flow {Tt} on Ω as the limit of them. Observing his method, the concept of consistency of flows which approximate {Tt} seems to play an essential role in his work [2]. As will be made clear in the following sections, the concept of consistency is closely related to the projective limiting structure of our basic space Ω. The purpose of this paper is to determine all the flows on Ω which can be approximated in the sense of [2] by finite dimensional flows.

Download Full-text

Uncertainty, equality, fraternity

Synthese ◽

10.1007/s11229-021-03217-1 ◽

2021 ◽

Author(s):

Rush T. Stewart

Keyword(s):

Probability Distribution ◽

General Framework ◽

Utility Functions ◽

Social Planner ◽

Imprecise Probabilities ◽

Veil Of Ignorance ◽

Epistemic States ◽

Uniform Probability ◽

Uniform Probability Distribution

AbstractEpistemic states of uncertainty play important roles in ethical and political theorizing. Theories that appeal to a “veil of ignorance,” for example, analyze fairness or impartiality in terms of certain states of ignorance. It is important, then, to scrutinize proposed conceptions of ignorance and explore promising alternatives in such contexts. Here, I study Lerner’s probabilistic egalitarian theorem in the setting of imprecise probabilities. Lerner’s theorem assumes that a social planner tasked with distributing income to individuals in a population is “completely ignorant” about which utility functions belong to which individuals. Lerner models this ignorance with a certain uniform probability distribution, and shows that, under certain further assumptions, income should be equally distributed. Much of the criticism of the relevance of Lerner’s result centers on the representation of ignorance involved. Imprecise probabilities provide a general framework for reasoning about various forms of uncertainty including, in particular, ignorance. To what extent can Lerner’s conclusion be maintained in this setting?

Download Full-text

New methods of construction of cartesian authentication codes from geometries over finite commutative rings

Journal of Mathematical Cryptology ◽

10.1515/jmc-2017-0057 ◽

2018 ◽

Vol 12 (3) ◽

pp. 119-136 ◽

Cited By ~ 1

Author(s):

Wachirapong Jirakitpuwapat ◽

Parin Chaipunya ◽

Poom Kumam ◽

Sompong Dhompongsa ◽

Phatiphat Thounthong

Keyword(s):

Probability Distribution ◽

Commutative Rings ◽

Impersonation Attack ◽

Authentication Codes ◽

New Methods ◽

Uniform Probability ◽

Cartesian Authentication Codes ◽

Uniform Probability Distribution ◽

Finite Commutative Rings

Abstract In this paper, we construct some cartesian authentication codes from geometries over finite commutative rings. We only assume the uniform probability distribution over the set of encoding rules in order to be able to compute the probabilities of successful impersonation attack and substitution attack. Our methods are comfortable and secure for users, i.e., our encoding rules reduce the probabilities of successful impersonation attack and substitution attack.

Download Full-text

A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM SINGULAR SYMPLECTIC SPACES OVER A FINITE FIELD

Discrete Mathematics Algorithms and Applications ◽

10.1142/s179383091450027x ◽

2014 ◽

Vol 06 (02) ◽

pp. 1450027

Author(s):

SHUFANG ZHAO ◽

ZENGTI LI

Keyword(s):

Probability Distribution ◽

Finite Field ◽

Symplectic Space ◽

Impersonation Attack ◽

Authentication Code ◽

Uniform Probability ◽

Uniform Probability Distribution ◽

Symplectic Spaces

In this paper, we construct a Cartesian authentication code from subspaces of singular symplectic space [Formula: see text] and compute its parameters. Assuming that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of successful impersonation attack and substitution attack are also computed.

Download Full-text

Limit distributions of the maximum size of a tree in a random recursive forest

Discrete Mathematics and Applications ◽

10.1515/dma-2002-0105 ◽

2002 ◽

Vol 12 (1) ◽

Author(s):

Yu.L. Pavlov ◽

E.A. Loseva

Keyword(s):

Probability Distribution ◽

Asymptotic Behaviour ◽

Maximum Size ◽

Rooted Trees ◽

Limit Distributions ◽

Uniform Probability ◽

Uniform Probability Distribution

AbstractWe consider the set of forests consisting of N recursive non-rooted trees with n vertices where the uniform probability distribution is defined. We give the complete description of the asymptotic behaviour of the maximum size of a tree in a forest as n → ∞.

Download Full-text

A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC

Discrete Mathematics Algorithms and Applications ◽

10.1142/s1793830909000075 ◽

2009 ◽

Vol 01 (01) ◽

pp. 105-114 ◽

Cited By ~ 5

Author(s):

ZENGTI LI ◽

SUOGANG GAO ◽

ZHONG WANG ◽

BHAVANI THURAISINGHAM ◽

WEILI WU

Keyword(s):

Probability Distribution ◽

Finite Field ◽

Impersonation Attack ◽

Authentication Code ◽

Orthogonal Space ◽

Uniform Probability ◽

Uniform Probability Distribution

In this paper, we construct a Cartesian authentication code from subspaces of orthogonal space [Formula: see text] of odd characteristic and compute its parameters. Assuming that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of successful impersonation attack and substitution attack are also computed.

Download Full-text