scholarly journals Improving the Gilbert-Varshamov bound for $q$-ary codes

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Van H. Vu ◽  
Lei Wu
Keyword(s):  
Recent Work ◽  
Positive Constant ◽  
Minimum Distance ◽  
Maximum Size ◽  
Binary Codes ◽  
International Audience ◽  
Positive Integers

International audience Given positive integers $q$, $n$ and $d$, denote by $A_q(n,d)$ the maximum size of a $q$-ary code of length $n$ and minimum distance $d$. The famous Gilbert-Varshamov bound asserts that $A_q(n,d+1) \geq q^n / V_q(n,d)$, where $V_q(n,d)=\sum_{i=0}^d \binom{n}{i}(q-1)^i$ is the volume of a $q$-ary sphere of radius $d$. Extending a recent work of Jiang and Vardy on binary codes, we show that for any positive constant $\alpha$ less than $(q-1)/q$ there is a positive constant $c$ such that for $d \leq \alpha n, A_q(n,d+1) \geq c \frac{q^n}{ V_q(n,d)}n$. This confirms a conjecture by Jiang and Vardy.

Two new bounds on the size of binary codes with a minimum distance of three

1995 ◽  
Vol 6 (3) ◽  
pp. 219-227 ◽  
Author(s):  
Yaron Klein ◽  
Simon Litsyn ◽  
Alexander Vardy
Keyword(s):  
Minimum Distance ◽  
Binary Codes

Analogue of a theorem of Khintchine in fields of formal power series

1966 ◽  
Vol 62 (4) ◽  
pp. 637-642 ◽  
Author(s):  
T. W. Cusick
Keyword(s):  
Power Series ◽  
Positive Constant ◽  
Classical Result ◽  
Real Numbers ◽  
Linear Forms ◽  
Absolute Value ◽  
The Difference ◽  
Image Position ◽  
Formal Power ◽  
Positive Integers

For a real number λ, ‖λ‖ is the absolute value of the difference between λ and the nearest integer. Let X represent the m-tuple (x1, x2, … xm) and letbe any n linear forms in m variables, where the Θij are real numbers. The following is a classical result of Khintchine (1):For all pairs of positive integers m, n there is a positive constant Г(m, n) with the property that for any forms Lj(X) there exist real numbers α1, α2, …, αn such thatfor all integers x1, x2, …, xm not all zero.

scholarly journals Graphs on Affine and Linear Spaces and Deuber Sets

10.37236/2732 ◽  
2013 ◽  
Vol 20 (2) ◽  
Author(s):  
David S. Gunderson ◽  
Hanno Lefmann
Keyword(s):  
Abelian Group ◽  
Finite Field ◽  
Recent Work ◽  
Independent Set ◽  
Large Set ◽  
Free Graph ◽  
Linear Spaces ◽  
Ramsey’S Theorem ◽  
Positive Integers ◽  
Arbitrary Abelian Group

If $G$ is a large $K_k$-free graph, by Ramsey's theorem, a large set of vertices is independent. For graphs whose vertices are positive integers, much recent work has been done to identify what arithmetic structure is possible in an independent set. This paper addresses  similar problems: for graphs whose vertices are affine or linear spaces over a finite field,  and when the vertices of the graph are elements of an arbitrary Abelian group.

scholarly journals Congruence successions in compositions

2014 ◽  
Vol Vol. 16 no. 1 (Combinatorics) ◽  
Author(s):  
Toufik Mansour ◽  
Mark Shattuck ◽  
Mark Wilson
Keyword(s):  
General Formula ◽  
Generating Function ◽  
Asymptotic Estimate ◽  
International Audience ◽  
Limiting Case ◽  
Positive Integers

Combinatorics International audience A composition is a sequence of positive integers, called parts, having a fixed sum. By an m-congruence succession, we will mean a pair of adjacent parts x and y within a composition such that x=y(modm). Here, we consider the problem of counting the compositions of size n according to the number of m-congruence successions, extending recent results concerning successions on subsets and permutations. A general formula is obtained, which reduces in the limiting case to the known generating function formula for the number of Carlitz compositions. Special attention is paid to the case m=2, where further enumerative results may be obtained by means of combinatorial arguments. Finally, an asymptotic estimate is provided for the number of compositions of size n having no m-congruence successions.

scholarly journals On the 2-adic order of Stirling numbers of the second kind and their differences

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Tamás Lengyel
Keyword(s):  
Positive Integer ◽  
Stirling Numbers ◽  
Bell Polynomials ◽  
Binary Representation ◽  
Exact Order ◽  
Special Cases ◽  
International Audience ◽  
The Difference ◽  
Divisibility Properties ◽  
Positive Integers

International audience Let $n$ and $k$ be positive integers, $d(k)$ and $\nu_2(k)$ denote the number of ones in the binary representation of $k$ and the highest power of two dividing $k$, respectively. De Wannemacker recently proved for the Stirling numbers of the second kind that $\nu_2(S(2^n,k))=d(k)-1, 1\leq k \leq 2^n$. Here we prove that $\nu_2(S(c2^n,k))=d(k)-1, 1\leq k \leq 2^n$, for any positive integer $c$. We improve and extend this statement in some special cases. For the difference, we obtain lower bounds on $\nu_2(S(c2^{n+1}+u,k)-S(c2^n+u,k))$ for any nonnegative integer $u$, make a conjecture on the exact order and, for $u=0$, prove part of it when $k \leq 6$, or $k \geq 5$ and $d(k) \leq 2$. The proofs rely on congruential identities for power series and polynomials related to the Stirling numbers and Bell polynomials, and some divisibility properties.

scholarly journals Statistics on Lattice Walks and q-Lassalle Numbers

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Lenny Tevlin
Keyword(s):  
Positive Integer ◽  
Generating Function ◽  
Catalan Numbers ◽  
Binomial Coefficients ◽  
Integer Coefficients ◽  
Major Index ◽  
Lattice Walks ◽  
International Audience ◽  
The Difference ◽  
Positive Integers

International audience This paper contains two results. First, I propose a $q$-generalization of a certain sequence of positive integers, related to Catalan numbers, introduced by Zeilberger, see Lassalle (2010). These $q$-integers are palindromic polynomials in $q$ with positive integer coefficients. The positivity depends on the positivity of a certain difference of products of $q$-binomial coefficients.To this end, I introduce a new inversion/major statistics on lattice walks. The difference in $q$-binomial coefficients is then seen as a generating function of weighted walks that remain in the upper half-plan. Cet document contient deux résultats. Tout d’abord, je vous propose un $q$-generalization d’une certaine séquence de nombres entiers positifs, liés à nombres de Catalan, introduites par Zeilberger (Lassalle, 2010). Ces $q$-integers sont des polynômes palindromiques à $q$ à coefficients entiers positifs. La positivité dépend de la positivité d’une certaine différence de produits de $q$-coefficients binomial.Pour ce faire, je vous présente une nouvelle inversion/major index sur les chemins du réseau. La différence de $q$-binomial coefficients est alors considérée comme une fonction de génération de trajets pondérés qui restent dans le demi-plan supérieur.

Hybrid Riser Tower for Deepwater Drill Centres

2007 ◽  
Author(s):  
Jean-Francois Saint-Marcoux ◽  
Robert D. Blevins
Keyword(s):  
West Africa ◽  
Recent Work ◽  
Production System ◽  
Minimum Distance ◽  
Interference Analysis ◽  
Wake Interference ◽  
Wake Instability ◽  
General Architecture

Hybrid Riser Towers, whether single bore or bundles minimise the riser load on Floating Processing Units and are field proven. Recent work has emphasised the effect of wake instability of parallel risers, and provided guidance for minimum distance between the risers. The paper describes the general architecture of a minimum Hybrid Riser Tower riser production system to be used for a drill centre, and the results of wake interference analysis for single bore HRTs and for a drill centre HRT’s in deepwater West Africa and GOM for turret-moored FPSO’s.

scholarly journals Oscillations in a nonautonomous delay logistic difference equation

1992 ◽  
Vol 35 (1) ◽  
pp. 121-131 ◽  
Author(s):  
Ch. G. Philos
Keyword(s):  
Difference Equation ◽  
Equilibrium Point ◽  
Positive Constant ◽  
Sufficient Conditions ◽  
Existence Of A Solution ◽  
Sharp Condition ◽  
All Solutions ◽  
Image Position ◽  
Positive Integers ◽  
Logistic Difference Equation

Consider the nonautonomous delay logistic difference equationwhere (pn)n≧0 is a sequence of nonnegative numbers, (ln)n≧0 is a sequence of positive integers with limn→∞(n−ln) = ∞ and K is a positive constant. Only solutions which are positive for n≧0 are considered. We established a sharp condition under which all solutions of (E0) are oscillatory about the equilibrium point K. Also we obtained sufficient conditions for the existence of a solution of (E0) which is nonoscillatory about K.

Sign in / Sign up

Export Citation Format

Share Document