, Collected Papers of Gerhard Gentzen, North-Holland, 1969. Edited by M. E. Szabo. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Unknown - (Correct)
....Klve and Mykkeltveit [15] introduced generalized Hamming weights while studying the weight distribution of irreducible cyclic codes and later Wei ( 27] rediscovered the idea of generalized Hamming weights. Following these, numerous papers dealing with these weights have been published (cf. [13], 26] etc. Recently, the generalized Hamming weights for codes over Z 4 have been defined and studied, see [1] 28] 29] 4] and [16] for example. In this work we generalize the definition to rings giving special attention to the ring Z 4 . Let R be a finite commutative ring, we assume ....
....for any r. It is known that if C is a linear code C of length n over Z 4 with rank(C) k and minimum Hamming weight dH , then Soc(C) is isomorphic to a binary [n, k, d] code (cf. 18] Lemma 4.16 ( 18] For any r, 1 r (C) d r (Soc(C) Using the above lemma and Theorem 3.19 (p. 35 in [13]) the lemma follows: Lemma 4.17 Let C be a linear code C of length n over Z 4 with rank(C) k. Then r (C) r (C) k. Now we have a generalized Griesmer type bound for GLWR. Theorem 4.18 Let C be a linear code C of length n over Z 4 with rank(C) k. Then r (C) # # # ....
Handbook of coding theory Vol. I (Edited by V. Pless, W. Hu#man and R. Brualdi), North-Holland, Amsterdam, 1998.
Extensions to the Johnson bound - Guruswami, Sudan (2001) (2 citations) (Correct)
....(n; d; e) minfn(q 1) nd nd 2e(n qe 2(q 1) g : 2) Furthermore, if e equals the R.H.S of Condition (1) then A 0 q (n; d; e) 2n(q 1) 1. Comparison with Previous Bounds: The second upper bound on A 0 q (n; d; e) in (2) is the classical version of Johnson bound for the q ary case (cf. [9]; proofs appear, for instance, in [10, 11] The new aspect of our result is the n(q 1) upper bound. For the case q = 2, this result was known. Speci cally, Elias [3] proved that if d is odd, then A 0 2 (n; d; e) n as long as e satis es 1 We use the notation A 0 q (n; d; e) instead of the ....
Handbook of Coding Theory, Volume I, V. S. Pless and W. C. Hu man, Editors, North-Holland, 1998.
Otakar Boruvka on Minimum Spanning Tree Problem.. - Nesetril.. (2000) (5 citations) (Correct)
....weight edge. 3. We apply the algorithm recursively to find the blue spanning tree T 0 of the contracted graph. The minimum spanning tree T is formed by the contracted blue edges together with the edges of T 0 . See [45] 42] 46] 12] 22] and most of the modern textbooks (such as [38] [50], 36] for various descriptions of Boruvka s algorithm. 8 History, remarks and perspectives The MST problem was isolated and attacked in the fifties with the vigor and confidence of then newly developing fields: theory of algorithms and computer science. The contributions were numerous and ....
Handbook of Combinatorics. (ed. Graham, R. L., Grotschel, M., Lov'asz, L.), North Holland, 1995.
Gödel's Functional ("Dialectica") Interpretation - Avigad, Feferman (1998) (Correct)
....as a by product, an ordinal analysis: over a weak base theory the assertion that there are no infinite descending sequences of ordinal notations beneath 0 implies the consistency of PA. 4.4. Infinitely long terms Another term model for T which is of special interest was provided by Tait [1965]. This uses infinitely long terms to replace the recursors, and thus produces a system of terms which is closer in character to the ordinary typed calculus. The closure conditions on terms are as follows: 1. There are infinitely many variables x ; y ; z ; of each type . 2. 0 is a ....
....a cut rank to reducible infinite terms, and lower cut complexity at the same exponential cost of increasing ordinal bounds. See Tait [1968] Schwichtenberg [1977] or Chapters III IV in this volume for more details concerning cut elimination for sequent calculi for infinitary languages, and Tait [1965] or Feferman [1977] for details concerning normalization for infinitary term calculi. More information can be extracted from these procedures as follows. Schwichtenberg [1977,section 4.2.2] shows in detail how the infinitary derivations generated from those in PA, as described above, may be coded ....
[Article contains additional citation context not shown here]
Foundations of Intuitionistic Mathematics, North-Holland, Amsterdam. U. W. Kohlenbach
Distributed Reflective Architectures - Kennedy (1999) (Correct)
....A distributed reflective architecture is a multi agent system where each agent acts like a metalevel for the others. Thus everything that is a meta level is simultaneously an object level. This concept is an interpretation of Maturana and Varela s organizational closure of a network ( 21] [34]) which is central to their theory of living systems. I will subsequently use the term meta level closure ) The concept is also the foundation of Second Order Cybernetics (see e.g. von Foerster [35] From the AI point of view, Minsky [24] has also discussed this issue in detail. It should ....
F. Varela Principles of Biological Autonomy, North-Holland, 1979.
The Complexity of the Disjunction and Existential Properties in .. - Buss, Mints (1999) (2 citations) (Correct)
No context found.
, Collected Papers of Gerhard Gentzen, North-Holland, 1969. Edited by M. E. Szabo.
Bounded Arithmetic and Propositional Proof Complexity - Buss (1995) (1 citation) (Correct)
No context found.
, Collected Papers of Gerhard Gentzen, North-Holland, 1969. Editted by M. E. Szabo.
A Variant of the Discrete Isoperimetric Problem - Hegarty (2002) (Correct)
No context found.
Handbook of Combinatorics, Vol. II. North-Holland 1995. 13
First-Order Proof Theory of Arithmetic - Buss (1998) (5 citations) (Correct)
No context found.
Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam. Edited by M. E. Szabo. J.-Y. Girard
First-Order Proof Theory of Arithmetic - Buss (1998) (5 citations) (Correct)
No context found.
Handbook of Mathematical Logic, North-Holland, Amsterdam. J. H. Bennett
Is Warfare An Art Or A Science? Implications For Command.. - Control Information.. (Correct)
No context found.
Science of Computer Programming, ISSN 0167-6423, North Holland.
The DOK Project: Towards the Integration of.. - Tari, Yetongnon.. (Correct)
No context found.
Semantic of Interoperable Systems, D. Hsiao, E. Neuhold and R. Davis #eds.#, North Holland 1993.
PROTEUS: A High-Performance Parallel-Architecture.. - Brewer, Dellarocas.. (1991) (144 citations) (Correct)
No context found.
Proceedings of the IFIP Congress, pages 1147#1153. North-Holland, August 1989.
The Complexity of the Disjunction and Existential Properties in .. - Buss, Mints (1998) (2 citations) (Correct)
No context found.
, Collected Papers of Gerhard Gentzen, North-Holland, 1969. Edited by M. E. Szabo.
Bounded Arithmetic and Propositional Proof Complexity - Buss (1995) (1 citation) (Correct)
No context found.
, Collected Papers of Gerhard Gentzen, North-Holland, 1969. Editted by M. E. Szabo.
Processes Of Flats Induced By Higher Dimensional Processes III - Goodey, Howard, Reeder (Correct)
No context found.
Representations of groups, North Holland, Amsterdam 1963. Gelfand, I. M., Graev, M. I. and Rosu, R.
The CoMoMAS Approach: From Conceptual Models to Executable Code - Glaser (1997) (1 citation) (Correct)
No context found.
Proc. of 1 st MAAMAW, North-Holland, 1990.
Processes Of Flats Induced By Higher Dimensional Processes III - Goodey, Howard, Reeder (Correct)
No context found.
Representations of groups, North Holland, Amsterdam 1963. Gelfand, I. M., Graev, M. I. and Ro¸su, R.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC