English
Related papers

Related papers: Code & order in polygonal billiards

200 papers

Rational polygonal billiards are one of the key models among the larger class of pseudo-integrable billiards. Their billiard flow may be lifted to the geodesic flow on a translation surface. Whereas such classical billiards have been much…

Mathematical Physics · Physics 2018-12-21 Omer Friedland , Henrik Ueberschaer

Hyperovals in $\PG(2,\gf(q))$ with even $q$ are maximal arcs and an interesting research topic in finite geometries and combinatorics. Hyperovals in $\PG(2,\gf(q))$ are equivalent to $[q+2,3,q]$ MDS codes over $\gf(q)$, called hyperoval…

Information Theory · Computer Science 2018-04-18 Ziling Heng , Cunsheng Ding

We study a class of planar billiards having the remarkable property that their phase space consists up to a set of zero measure of two invariant sets formed by orbits moving in opposite directions. The tables of these billiards are tubular…

Dynamical Systems · Mathematics 2009-11-13 Leonid A. Bunimovich , Gianluigi Del Magno

The cyclic codes with parity check polynomial the reciprocal of the characteristic polynomial of the Fibonacci recurrence over a prime finite field are shown to have either one weight or two weights. When these codes are irreducible cyclic…

Information Theory · Computer Science 2017-09-15 Minjia Shi , Zhongyi Zhang , Patrick Sole

We study rational circular billiards. By viewing the trajectory formed after each reflection point to another inside the circle as the number of circle divisions into regions we derive a general formula for the number of division regions…

Dynamical Systems · Mathematics 2023-06-05 Daniel Jaud

In this paper we characterize the orbit codes as geometrically uniform codes. This characterization is based on the description of all isometries over a projective geometry. In addition, the Abelian orbit codes are defined and a new…

Information Theory · Computer Science 2018-10-19 Gustavo Terra Bastos , Reginaldo Palazzo Júnior , Marinês Guerreiro

We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…

Combinatorics · Mathematics 2018-04-10 Juergen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

In this paper, we explore a connection between binary hierarchical models, their marginal polytopes and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is…

Statistics Theory · Mathematics 2016-04-08 Thomas Kahle , Walter Wenzel , Nihat Ay

In this paper, we introduce and investigate the neighborhood of binary self-dual codes. We prove that there is no better Type I code than the best Type II code of the same length. Further, we give some new necessary conditions for the…

Information Theory · Computer Science 2023-01-18 Carolin Hannusch , S. Roland Major

Given a (simple) grid polygon $P$ in a grid of equilateral triangles, Defant and Jiradilok considered a billiards system where beams of light bounce around inside of $P$. We study the relationship between the perimeter…

Combinatorics · Mathematics 2024-04-23 Honglin Zhu

In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characters is slightly less than half of its length, then it is equivalent to an Euclidean self-orthogonal code.…

Information Theory · Computer Science 2013-08-19 Lingfei Jin , Chaoping Xing

We examine and compare several different classes of "balanced" block codes over q-ary alphabets, namely symbol-balanced (SB) codes, charge-balanced (CB) codes, and polarity-balanced (PB) codes. Known results on the maximum size and…

Information Theory · Computer Science 2013-01-29 Jos H. Weber , Kees A. Schouhamer Immink , Paul H. Siegel , Theo G. Swart

Let $\Psi_{k,n}$ denote the number of inequivalent binary self-orthogonal $[n,k]$ codes. We present a method which allows us to compute $\Psi_{k,n}$ explicitly for a moderate $k$ and an arbitrary $n$. Included in this paper are explicit…

Combinatorics · Mathematics 2007-05-23 Xiang-dong Hou

An elementary application of Algorithmic Complexity Theory to the polygonal approximations of curved billiards-integrable and chaotic-unveils the equivalence of this problem to the procedure of quantization of classical systems: the scaling…

chao-dyn · Physics 2009-10-31 Giorgio Mantica

The polyadic integer numbers, which form a polyadic ring, are representatives of a fixed congruence class. The basics of polyadic arithmetic are presented: prime polyadic numbers, the polyadic Euler function, polyadic division with a…

Rings and Algebras · Mathematics 2017-11-09 Steven Duplij

A circular Andreev billiard in a uniform magnetic field is studied. It is demonstrated that the classical dynamics is pseudointegrable in the same sense as for rational polygonal billiards. The relation to a specific polygon, the asymmetric…

Chaotic Dynamics · Physics 2009-11-07 Jan Wiersig

A square matrix is said to be circular bidiagonal whenever (i) each nonzero entry is on the diagonal, or the subdiagonal, or in the top-right corner; (ii) each subdiagonal entry is nonzero, and the entry in the top-right corner is nonzero.…

Quantum Algebra · Mathematics 2024-07-04 Paul Terwilliger , Arjana Žitnik

We investigate a rotated, orthogonal gravitational wedge billiard - a special case of the asymmetric wedge billiard - in which the dynamics are integrable. We derive equations and conditions under which periodic orbits may be constructed…

Dynamical Systems · Mathematics 2023-10-10 K. D. Anderson

Recently, a $q$-polynomial approach to the construction and analysis of cyclic codes over $\gf(q)$ was given by Ding and Ling. The objective of this paper is to give another $q$-polynomial approach to all cyclic codes over $\gf(q)$.

Information Theory · Computer Science 2016-10-21 Can Xiang

The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic…

Information Theory · Computer Science 2024-02-05 Stefka Bouyuklieva