Additional Simple Quadratures in the Complex Plane.
Philip J. Davis (1969)
Aequationes mathematicae
Similarity:
Displaying similar documents to “The Gauss code problem off the plane.”
Additional Simple Quadratures in the Complex Plane.
On the enumeration of a class of plane multigraphs.
Ronald C. Read (1986)
Aequationes mathematicae
Similarity:
Necessary and Sufficient Conditions for the Extendability of Ternary Linear Codes
Okamoto, Kei (2008)
Serdica Journal of Computing
Similarity:
We give the necessary and sufficient conditions for the extendability of ternary linear codes of dimension k ≥ 5 with minimum distance d ≡ 1 or 2 (mod 3) from a geometrical point of view.
On optimal linear codes over .
Kanazawa, Rie, Maruta, Tatsuya (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Optimal four-dimensional codes over .
Jones, Chris, Matney, Angela, Ward, Harold (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Construction of codes identifying sets of vertices.
Gravier, Sylvain, Moncel, Julien (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Codes from cubic curves and their extensions.
Alderson, T.L., Bruen, A.A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Divisible Codes - A Survey
Ward, Harold (2001)
Serdica Mathematical Journal
Similarity:
This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over finite fields. Then it presents recent results on bounds and applications to optimal codes.
The Nonexistence of [132, 6, 86]3 Codes and [135, 6, 88]3 Codes
Oya, Yusuke (2011)
Serdica Journal of Computing
Similarity:
We prove the nonexistence of [g3(6, d), 6, d]3 codes for d = 86, 87, 88, where g3(k, d) = ∑⌈d/3i⌉ and i=0 ... k−1. This determines n3(6, d) for d = 86, 87, 88, where nq(k, d) is the minimum length n for which an [n, k, d]q code exists.
On the Weight Distribution of the Coset Leaders of Constacyclic Codes
Velikova, Evgeniya, Bojilov, Asen (2008)
Serdica Journal of Computing
Similarity:
Constacyclic codes with one and the same generator polynomial and distinct length are considered. We give a generalization of the previous result of the first author [4] for constacyclic codes. Suitable maps between vector spaces determined by the lengths of the codes are applied. It is proven that the weight distributions of the coset leaders don’t depend on the word length, but on generator polynomials only. In particular, we prove that every constacyclic code has the same weight distribution...
Construction of Optimal Linear Codes by Geometric Puncturing
Maruta, Tatsuya (2013)
Serdica Journal of Computing
Similarity:
Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to construct new codes. ACM Computing Classification System (1998): E.4. ∗This research was partially supported by Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science under Contract Number 24540138.