Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    On the construction of [q 4 + q 2 − q, 5,q 4 − q 3 + q 2 − 2q; q]-codes meeting the Griesmer bound (1992)
    Springer
    Designs, codes and cryptography 2 (1992), S. 225-229 
    Details
    ISSN: 1573-7586
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is unknown whether or not there exists an [87, 5, 57; 3]-code. Such a code would meet the Griesmer bound. The purpose of this paper is to give a constructive proof of the existence of [q 4 + q 2 − q, 5, q 4 − q 3 + q 2 − 2q; q]-codes for any prime power q ≥ 3. As a special case, it is shown that there exists an [87, 5, 57; 3]-code with weight enumerator 1 + 156z 37 + 82z 60 + 2z 63 + 2z 78. The new construction settles an open problem due to Hill and Newton [10].
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00141966
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The nonexistence of ternary [50,5,32] codes (1996)
    Springer
    Designs, codes and cryptography 7 (1996), S. 235-237 
    Details
    ISSN: 1573-7586
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is unknown (cf. Hill and Newton [8] or Hamada [3]) whether or not there exists a ternary [50, 5, 32] code meeting the Griesmer bound. The purpose of this paper is to prove the nonexistence of ternary [50, 5, 32] codes. Since there exists a ternary [51, 5, 32] code, this implies that n 3(5, 32) = 51, where n 3(k, d) denotes the smallest value of n for which there exists a ternary [n, k, d] code.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00124514
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Characterization of {(q + 1) + 2, 1;t, q}-min · hypers and {2(q + 1) + 2, 2; 2,q}-min · hypers in a Finite projective geometry (1989)
    Springer
    Graphs and combinatorics 5 (1989), S. 63-81 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, we shall characterize all {(q + 1) + 2, 1;t, q}-min · hypers and all {2(q + 1) + 2, 2; 2,q}-min · hypers for any integert ≥ 2 and any prime powerq ≥ 3. In the next paper [8], we shall characterize all {2(q + 1) + 2, 2;t, q}-min · hypers for any integert ≥ 3 and any prime powerq ≥ 5 using the results in this paper.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01788659
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Characterization of {v μ+1 + 2v μ,v μ + 2v μ − 1;t,q}-min · hypers and its applications to error-correcting codes (1989)
    Springer
    Graphs and combinatorics 5 (1989), S. 137-147 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Recently, Hamada [5] characterized all {v 2 + 2v 1,v 1 + 2v 0;t,q}-min · hypers for any integert ≧ 2 and any prime powerq ≧ 3 wherev l = (q l − 1)/(q − 1) for any integerl ≧ 0. The purpose of this paper is to characterize all {v μ + 1 + 2v μ,v μ + 2v μ − 1;t,q}-min · hypers for any integerst, μ and any prime powerq such thatt ≧ 3, 2 ≦ μ ≦ t − 1 andq ≧ 5 and to characterize all (n, k, d; q)-codes meeting the Griesmer bound (1.1) for the casek ≧ 3, d = q k-1 − (2q μ-1 +q μ) andq ≧ 5 using the results in Hamada [3, 4, 5].
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01788665
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Hepatocellular carcinoma with obstructive jaundice successfully treated with a self-expandable metallic stent (1998)
    Springer
    Journal of gastroenterology 33 (1998), S. 886-890 
    Details
    ISSN: 1435-5922
    Keywords: Key words: self-expandable metallic stent ; obstructive jaundice ; hepatocellular carcinoma
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Abstract: We report on a 71-year old man with hepatocellular carcinoma (HCC) whose obstructive jaundice was successfully treated with external irradiation and a self-expandable metallic stent (EMS); Wallstent; Schneider (Europe) AG, Bülach, Switzerland. He was admitted to our hospital because of jaundice. HCC was found in S8; the tumor had invaded the bile duct with growth in the common hepatic duct. Endoscopic nasobiliary drainage was performed with difficulty. Radiation therapy to the stenosis enabled us to place a Wallstent endoscopically. He survived without icterus for 1 year.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s005350050194
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Anterior pituitary, thyroid, parathyroid and adrenal responses to subtotal thyroidectomy in patients with Graves’ disease (1982)
    Springer
    Surgery today 12 (1982), S. 235-243 
    Details
    ISSN: 1436-2813
    Keywords: Graves’ disease ; subtotal thyroidectomy ; endocrine response
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Abstract Changes in the serum levels of anterior pituitary, thyroid, parathyroid, and adrenal hormones following subtotal thyroidectomy in 31 patients with Graves’ disease were investigated. In 14 patients, rapid ACTH tests were performed on the preoperative and the first, third, and seventh postoperative days. Remarkable differences were not seen with regard to the changes in anterior pituitary hormones or cortisol, compared to those seen during general surgery. As to the thyroid hormones, the serum level of triioodothyronine (T3) decreased markedly after surgery and fell to half that of the preoperative value on the first postoperative day. Thereafter, a low value of T3 was maintained during the early postoperative period. Unlike T3, the serum level of thyroxine (T4) decreased gradually until the 7th post-operative day. The levels of both epinephrine and norepinephrine increased transiently during surgery, but the serum level of norepinephrine increased again on the third postoperative day. In the postoperative period, almost half the number of patients showed an inadequate cortisol response to rapid ACTH tests. It is suggested that the unique responses, such as the rise in serum norepinephrine or an inadequate response of cortisol to ACTH, or hypocalcemia, after subtotal thyroidectomy in patients with Graves’ disease is largely due to the rapid decrease of T3 in the hypothyroid state, as was noted during the postoperative period.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02469554
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    A Necessary and Sufficient Condition for the Existence of Some Ternary [n, k, d] Codes Meeting the Greismer Bound (1997)
    Springer
    Designs, codes and cryptography 10 (1997), S. 41-56 
    Details
    ISSN: 1573-7586
    Keywords: ternary linear code ; Griesmer bound ; minihyper
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Let k and d be any integers such that k ≥ 4 and $$$$ . Then there exist two integers α and β in {0,1,2} such that $$$$ . The purpose of this paper is to prove that (1) in the case k ≥5 and (α,β) = (0,1), there exists a ternary $$\left[ {n,k,d} \right] $$ code meeting the Griesmer bound if and only if $$3^{k - 1} - 3^{k - 2} - 2 \leqslant d \leqslant 3^{k - 1} - 3^{k - 2} $$ and (2) in the case k ≥4 and (α,β) = (0,2) or (1,1), there is no ternary $$\left[ {n,k,d} \right] $$ code meeting the Griesmer bound for any integers k and d and (3) in the case k ≥5 and $$d = 3^{k - 1} - 3^{\lambda + 1} - 3^{k - 2} $$ , there is no projective ternary $$[g_3 (k,d) + 1,k,d] $$ code for any integers k and λ such that 1≤λ≤k-3, where $${\text{g}}_{\text{3}} (k,d) = \upsilon _k - \upsilon _{\lambda + 2} - \upsilon _{k - 1} $$ and $$\upsilon _i = (3^i - 1)/(3 - 1) $$ for any integer i ≥0. In the special case k=6, it follows from (1) that there is no ternary linear code with parameters [233,6,154] , [234,6,155] or [237,6,157] which are new results.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008288219580
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    The Nonexistence of Ternary [50,5,32] Codes (1996)
    Springer
    Designs, codes and cryptography 7 (1996), S. 235-237 
    Details
    ISSN: 1573-7586
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is unknown (cf. Hill and Newton [8] or Hamada [3]) whether or not there exists a ternary [50,5,32] code meeting the Griesmer bound. The purpose of this paper is to prove the nonexistence of ternary [50,5,32] codes. Since there exists a ternary [51,5,32] code, this implies that n3(5,32) = 51, where n3(k,d) denotes the smallest value of n for which there exists a ternary [n,k,d] code.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018042823954
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    The Nonexistence of Ternary [38, 6, 23] Codes (1998)
    Springer
    Designs, codes and cryptography 13 (1998), S. 165-172 
    Details
    ISSN: 1573-7586
    Keywords: ternary linear codes ; finite projective geometries
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It has been shown by Bogdanova and Boukliev [1] that there exist a ternary [38,5,24] code and a ternary [37,5,23] code. But it is unknown whether or not there exist a ternary [39,6,24] code and a ternary [38,6,23] code. The purpose of this paper is to prove that (1) there is no ternary [39,6,24] code and (2) there is no ternary [38,6,23] code using the nonexistence of ternary [39,6,24] codes. Since it is known (cf. Brouwer and Sloane [2] and Hamada and Watamori [14]) that (i) n3(6,23) = 38〉 or 39 and d3(38,6) = 22 or 23 and (ii) n3(6,24) = 39 or 40 and d3(39,6) = 23 or 24, this implies that n3(6,23) = 39, d3(38,6) = 22, n3(6,24) = 40 and d3(39,6) = 23, where n3〈〉(k,d) and d〈〉3(n,k) denote the smallest value of n and the largest value of d, respectively, for which there exists an [n,k,d] code over the Galois field GF(3).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008278312966
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...