Results 11 to 20 of about 38,638 (199)
Lexicographic codes: Error-correcting codes from game theory [PDF]
Summary: Lexicographic codes, or lexicodes, are defined by various versions of the greedy algorithm. The theory of these codes is closely related to the theory of certain impartial games, which leads to a number of surprising properties. For example, lexicodes over an alphabet of size \(B=2^ a\) are closed under addition, while if \(B=2^{2^ a}\) the ...
Conway, John H., Sloane, N. J. A.
openaire +2 more sources
The Spectrum of Weighted Lexicographic Product on Self-Complementary Graphs
The lexicographic product, a powerful binary operation in graph theory, offers methods for creating a novel graph by establishing connections between each vertex of one graph and every vertex of another.
Xiaoxiao Zhang, Zenghui Fang
doaj +1 more source
The following extension of the Erdős-Szekeres theorem is proved. If \(d,n\) are positive integers then there exists an integer \(N\) such that if \(f\) is an injection from \(\{1,2,\dots,N\}^ d\) into the reals then there is an \(n\times\cdots\times n\) subcube on which \(f\) is lexicographic and monotonic on each coordinate.
Fishburn, P.C, Graham, R.L
openaire +1 more source
Within the field of lexicography there are numerous differences when it comes to the interpretation of the term lexicography and differences in determining the nature, extent and scope of this term.
Henning Bergenholtz, Rufus H. Gouws
doaj +1 more source
'n Leksikografiese datatrekkingstruktuur vir aanlyn woordeboeke
A Lexicographic Data Pulling Structure for Online Dictionaries. In the field of lexicography the transition from printed to online dictionaries has had a significant influence on numerous aspects of both lexicographic theory and the lexicographic ...
Rufus H. Gouws
doaj +1 more source
The Lexicographic Method in Preference Theory [PDF]
AbstractLexicographically ordered sets of binary criteria provide a uniform measure of how concisely a preference can be represented and how efficiently an agent can make decisions. This measure leads to: (1) sharper conclusions about which preferences are easy to represent than the economics test of checking if a preference has a utility ...
openaire +1 more source
Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marco Cococcioni +2 more
openaire +1 more source
Generalized Hamming weights of affine cartesian codes [PDF]
In this article, we give the answer to the following question: Given a field $\mathbb{F}$, finite subsets $A_1,\dots,A_m$ of $\mathbb{F}$, and $r$ linearly independent polynomials $f_1,\dots,f_r \in \mathbb{F}[x_1,\dots,x_m]$ of total degree at most $d$.
Beelen, Peter, Datta, Mrinmoy
core +2 more sources
Universality theorems for inscribed polytopes and Delaunay triangulations [PDF]
We prove that every primary basic semialgebraic set is homotopy equivalent to the set of inscribed realizations (up to M\"obius transformation) of a polytope. If the semialgebraic set is moreover open, then, in addition, we prove that (up to homotopy) it
Adiprasito, Karim A. +2 more
core +1 more source
Lexicography in the Information Age
<p>Abstract: Lexicography has much to contribute to the information and knowledge society. The very essence of lexicography is its capacity to provide quick and easy access to data from which information needed by different types of users in ...
Sven Tarp
doaj +1 more source

