Codes based on complete graphs View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1996-05

AUTHORS

Dieter Jungnickel, Marialuisa J. De Resmini, Scott A. Vanstone

ABSTRACT

We consider the problem of embedding the even graphical code based on the complete graph onn vertices into a shortening of a Hamming code of length 2m-1, wherem = h(n) should be as small as possible. As it turns out, this problem is equivalent to the existence problem for optimal codes with minimum distance 5, and optimal embeddings can always be realized as graphical codes based onKn. As a consequence, we are able to determineh(n) exactly for alln of the form 2k + 1 and to narrow down the possibilities in general to two or three conceivable values. More... »

PAGES

159-165

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bf00130575

DOI

http://dx.doi.org/10.1007/bf00130575

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1042677640


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Augsburg", 
          "id": "https://www.grid.ac/institutes/grid.7307.3", 
          "name": [
            "Lehrstuhl f\u00fcr Angewandte Mathematik II, Universit\u00e4t Augsburg, D-86135, Augsburg, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jungnickel", 
        "givenName": "Dieter", 
        "id": "sg:person.016273474670.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016273474670.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Sapienza University of Rome", 
          "id": "https://www.grid.ac/institutes/grid.7841.a", 
          "name": [
            "Dipartimento di Matematica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, 2, Piazzale Aldo Moro, 1-00185, Roma, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "De Resmini", 
        "givenName": "Marialuisa J.", 
        "id": "sg:person.012712302064.14", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012712302064.14"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Waterloo", 
          "id": "https://www.grid.ac/institutes/grid.46078.3d", 
          "name": [
            "Dept. of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ont., Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Vanstone", 
        "givenName": "Scott A.", 
        "id": "sg:person.010344544767.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/s0378-3758(96)00166-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1018084811"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/18.212301", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061098874"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/18.567663", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061100231"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tit.1967.1053983", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061646305"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tit.1968.1054190", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061646506"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://app.dimensions.ai/details/publication/pub.1109703686", 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-1-349-03521-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1109703686", 
          "https://doi.org/10.1007/978-1-349-03521-2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-1-349-03521-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1109703686", 
          "https://doi.org/10.1007/978-1-349-03521-2"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1996-05", 
    "datePublishedReg": "1996-05-01", 
    "description": "We consider the problem of embedding the even graphical code based on the complete graph onn vertices into a shortening of a Hamming code of length 2m-1, wherem = h(n) should be as small as possible. As it turns out, this problem is equivalent to the existence problem for optimal codes with minimum distance 5, and optimal embeddings can always be realized as graphical codes based onKn. As a consequence, we are able to determineh(n) exactly for alln of the form 2k + 1 and to narrow down the possibilities in general to two or three conceivable values.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/bf00130575", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1136552", 
        "issn": [
          "0925-1022", 
          "1573-7586"
        ], 
        "name": "Designs, Codes and Cryptography", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1-2", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "8"
      }
    ], 
    "name": "Codes based on complete graphs", 
    "pagination": "159-165", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "cb4a7b0649b2bc6a8b1889c3d0e4667f365fbf88d14e60a42355b656588f0b6a"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf00130575"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1042677640"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf00130575", 
      "https://app.dimensions.ai/details/publication/pub.1042677640"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T13:52", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000371_0000000371/records_130805_00000003.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007/BF00130575"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/bf00130575'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/bf00130575'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf00130575'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf00130575'


 

This table displays all metadata directly associated to this object as RDF triples.

102 TRIPLES      21 PREDICATES      34 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf00130575 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author Nade87d74615f4a8eb7d2a777e0ae8af3
4 schema:citation sg:pub.10.1007/978-1-349-03521-2
5 https://app.dimensions.ai/details/publication/pub.1109703686
6 https://doi.org/10.1016/s0378-3758(96)00166-8
7 https://doi.org/10.1109/18.212301
8 https://doi.org/10.1109/18.567663
9 https://doi.org/10.1109/tit.1967.1053983
10 https://doi.org/10.1109/tit.1968.1054190
11 schema:datePublished 1996-05
12 schema:datePublishedReg 1996-05-01
13 schema:description We consider the problem of embedding the even graphical code based on the complete graph onn vertices into a shortening of a Hamming code of length 2m-1, wherem = h(n) should be as small as possible. As it turns out, this problem is equivalent to the existence problem for optimal codes with minimum distance 5, and optimal embeddings can always be realized as graphical codes based onKn. As a consequence, we are able to determineh(n) exactly for alln of the form 2k + 1 and to narrow down the possibilities in general to two or three conceivable values.
14 schema:genre research_article
15 schema:inLanguage en
16 schema:isAccessibleForFree false
17 schema:isPartOf N94b5277471024731ad6d72fbe7d644a2
18 Ne3fbfaa2afd04a48a51f25be3f44f2cd
19 sg:journal.1136552
20 schema:name Codes based on complete graphs
21 schema:pagination 159-165
22 schema:productId N19c9318a20a843568cb0dc06c26d3bbe
23 N27006b51dbf54c09a4c46cfe15d48d35
24 Ne27121c20cd24720aa4b047c0da3cb27
25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042677640
26 https://doi.org/10.1007/bf00130575
27 schema:sdDatePublished 2019-04-11T13:52
28 schema:sdLicense https://scigraph.springernature.com/explorer/license/
29 schema:sdPublisher N86af45952054416f8c8612fd14811fc0
30 schema:url http://link.springer.com/10.1007/BF00130575
31 sgo:license sg:explorer/license/
32 sgo:sdDataset articles
33 rdf:type schema:ScholarlyArticle
34 N19c9318a20a843568cb0dc06c26d3bbe schema:name doi
35 schema:value 10.1007/bf00130575
36 rdf:type schema:PropertyValue
37 N27006b51dbf54c09a4c46cfe15d48d35 schema:name readcube_id
38 schema:value cb4a7b0649b2bc6a8b1889c3d0e4667f365fbf88d14e60a42355b656588f0b6a
39 rdf:type schema:PropertyValue
40 N3978471ad92c4dac981d9dbd615ad549 rdf:first sg:person.010344544767.07
41 rdf:rest rdf:nil
42 N738a066a6e2c4af78f79617ab81e2474 rdf:first sg:person.012712302064.14
43 rdf:rest N3978471ad92c4dac981d9dbd615ad549
44 N86af45952054416f8c8612fd14811fc0 schema:name Springer Nature - SN SciGraph project
45 rdf:type schema:Organization
46 N94b5277471024731ad6d72fbe7d644a2 schema:issueNumber 1-2
47 rdf:type schema:PublicationIssue
48 Nade87d74615f4a8eb7d2a777e0ae8af3 rdf:first sg:person.016273474670.91
49 rdf:rest N738a066a6e2c4af78f79617ab81e2474
50 Ne27121c20cd24720aa4b047c0da3cb27 schema:name dimensions_id
51 schema:value pub.1042677640
52 rdf:type schema:PropertyValue
53 Ne3fbfaa2afd04a48a51f25be3f44f2cd schema:volumeNumber 8
54 rdf:type schema:PublicationVolume
55 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
56 schema:name Information and Computing Sciences
57 rdf:type schema:DefinedTerm
58 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
59 schema:name Data Format
60 rdf:type schema:DefinedTerm
61 sg:journal.1136552 schema:issn 0925-1022
62 1573-7586
63 schema:name Designs, Codes and Cryptography
64 rdf:type schema:Periodical
65 sg:person.010344544767.07 schema:affiliation https://www.grid.ac/institutes/grid.46078.3d
66 schema:familyName Vanstone
67 schema:givenName Scott A.
68 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07
69 rdf:type schema:Person
70 sg:person.012712302064.14 schema:affiliation https://www.grid.ac/institutes/grid.7841.a
71 schema:familyName De Resmini
72 schema:givenName Marialuisa J.
73 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012712302064.14
74 rdf:type schema:Person
75 sg:person.016273474670.91 schema:affiliation https://www.grid.ac/institutes/grid.7307.3
76 schema:familyName Jungnickel
77 schema:givenName Dieter
78 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016273474670.91
79 rdf:type schema:Person
80 sg:pub.10.1007/978-1-349-03521-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1109703686
81 https://doi.org/10.1007/978-1-349-03521-2
82 rdf:type schema:CreativeWork
83 https://app.dimensions.ai/details/publication/pub.1109703686 schema:CreativeWork
84 https://doi.org/10.1016/s0378-3758(96)00166-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018084811
85 rdf:type schema:CreativeWork
86 https://doi.org/10.1109/18.212301 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061098874
87 rdf:type schema:CreativeWork
88 https://doi.org/10.1109/18.567663 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061100231
89 rdf:type schema:CreativeWork
90 https://doi.org/10.1109/tit.1967.1053983 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061646305
91 rdf:type schema:CreativeWork
92 https://doi.org/10.1109/tit.1968.1054190 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061646506
93 rdf:type schema:CreativeWork
94 https://www.grid.ac/institutes/grid.46078.3d schema:alternateName University of Waterloo
95 schema:name Dept. of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ont., Canada
96 rdf:type schema:Organization
97 https://www.grid.ac/institutes/grid.7307.3 schema:alternateName University of Augsburg
98 schema:name Lehrstuhl für Angewandte Mathematik II, Universität Augsburg, D-86135, Augsburg, Germany
99 rdf:type schema:Organization
100 https://www.grid.ac/institutes/grid.7841.a schema:alternateName Sapienza University of Rome
101 schema:name Dipartimento di Matematica, Università di Roma “La Sapienza”, 2, Piazzale Aldo Moro, 1-00185, Roma, Italy
102 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...