The completion determination of optimal (3,4)-packings View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2015-10

AUTHORS

Jingjun Bao, Lijun Ji

ABSTRACT

A (3,4)-packing consists of an n-element set X and a collection of 4-element subsets of X, called blocks, such that every 3-element subset of X is contained in at most one block. The packing number of quadruples d(3,4,n) denotes the number of blocks in a maximum (3,4)-packing, which is also the maximum number A(n,4,4) of codewords in a code of length n, constant weight 4, and minimum Hamming distance 4. In this paper the undecided 21 packing numbers A(n,4,4) are shown to be equal to Johnson bound J(n,4,4)(=⌊n4⌊n-13⌊n-22⌋⌋⌋). More... »

PAGES

217-229

References to SciGraph publications

  • 2006-01. Asymptotic Determination of the Last Packing Number of Quadruples in DESIGNS, CODES AND CRYPTOGRAPHY
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s10623-014-0001-2

    DOI

    http://dx.doi.org/10.1007/s10623-014-0001-2

    DIMENSIONS

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


    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/0914", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Resources Engineering and Extractive Metallurgy", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/09", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Engineering", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Soochow University", 
              "id": "https://www.grid.ac/institutes/grid.263761.7", 
              "name": [
                "Department of Mathematics, Soochow University, 215006, Suzhou, China"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Bao", 
            "givenName": "Jingjun", 
            "id": "sg:person.07531500520.10", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07531500520.10"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Soochow University", 
              "id": "https://www.grid.ac/institutes/grid.263761.7", 
              "name": [
                "Department of Mathematics, Soochow University, 215006, Suzhou, China"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Ji", 
            "givenName": "Lijun", 
            "id": "sg:person.014442111105.21", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014442111105.21"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/s10623-004-5662-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021975580", 
              "https://doi.org/10.1007/s10623-004-5662-9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10623-004-5662-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021975580", 
              "https://doi.org/10.1007/s10623-004-5662-9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0097-3165(82)90001-2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022732319"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0097-3165(79)90050-5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1028008394"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0097-3165(91)90035-f", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031873474"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0012-365x(92)00055-v", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1034457549"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1002/jcd.20184", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046529445"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.disc.2011.10.016", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047104119"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0012-365x(72)90027-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1053342579"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/18.59932", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061100341"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.4153/cjm-1960-013-3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1072264294"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2015-10", 
        "datePublishedReg": "2015-10-01", 
        "description": "A (3,4)-packing consists of an n-element set X and a collection of 4-element subsets of X, called blocks, such that every 3-element subset of X is contained in at most one block. The packing number of quadruples d(3,4,n) denotes the number of blocks in a maximum (3,4)-packing, which is also the maximum number A(n,4,4) of codewords in a code of length n, constant weight 4, and minimum Hamming distance 4. In this paper the undecided 21 packing numbers A(n,4,4) are shown to be equal to Johnson bound J(n,4,4)(=\u230an4\u230an-13\u230an-22\u230b\u230b\u230b).", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/s10623-014-0001-2", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1136552", 
            "issn": [
              "0925-1022", 
              "1573-7586"
            ], 
            "name": "Designs, Codes and Cryptography", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "1", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "77"
          }
        ], 
        "name": "The completion determination of optimal (3,4)-packings", 
        "pagination": "217-229", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "1aa762ac8fb7a77d76c701689b4b81968b3099e3fece09160fa23795f92aeb3d"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s10623-014-0001-2"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1005594259"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s10623-014-0001-2", 
          "https://app.dimensions.ai/details/publication/pub.1005594259"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-10T15:51", 
        "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/0000000001_0000000264/records_8664_00000510.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "http://link.springer.com/10.1007%2Fs10623-014-0001-2"
      }
    ]
     

    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/s10623-014-0001-2'

    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/s10623-014-0001-2'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10623-014-0001-2'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10623-014-0001-2'


     

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

    99 TRIPLES      21 PREDICATES      37 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s10623-014-0001-2 schema:about anzsrc-for:09
    2 anzsrc-for:0914
    3 schema:author Nf600298e78614094aea1bcd24ec4b7a2
    4 schema:citation sg:pub.10.1007/s10623-004-5662-9
    5 https://doi.org/10.1002/jcd.20184
    6 https://doi.org/10.1016/0012-365x(72)90027-1
    7 https://doi.org/10.1016/0012-365x(92)00055-v
    8 https://doi.org/10.1016/0097-3165(79)90050-5
    9 https://doi.org/10.1016/0097-3165(82)90001-2
    10 https://doi.org/10.1016/0097-3165(91)90035-f
    11 https://doi.org/10.1016/j.disc.2011.10.016
    12 https://doi.org/10.1109/18.59932
    13 https://doi.org/10.4153/cjm-1960-013-3
    14 schema:datePublished 2015-10
    15 schema:datePublishedReg 2015-10-01
    16 schema:description A (3,4)-packing consists of an n-element set X and a collection of 4-element subsets of X, called blocks, such that every 3-element subset of X is contained in at most one block. The packing number of quadruples d(3,4,n) denotes the number of blocks in a maximum (3,4)-packing, which is also the maximum number A(n,4,4) of codewords in a code of length n, constant weight 4, and minimum Hamming distance 4. In this paper the undecided 21 packing numbers A(n,4,4) are shown to be equal to Johnson bound J(n,4,4)(=⌊n4⌊n-13⌊n-22⌋⌋⌋).
    17 schema:genre research_article
    18 schema:inLanguage en
    19 schema:isAccessibleForFree false
    20 schema:isPartOf N8ac987ad845e4e589f72dcbcf5d2b83c
    21 Nb78beb6a17ea42a8a5c42cf6892a18a9
    22 sg:journal.1136552
    23 schema:name The completion determination of optimal (3,4)-packings
    24 schema:pagination 217-229
    25 schema:productId N087482d199274399af2f8f475360bd0d
    26 N28c5d738d23d494ead09ee9de6ce95da
    27 N878c001c188745588bfd8d191dcd719e
    28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005594259
    29 https://doi.org/10.1007/s10623-014-0001-2
    30 schema:sdDatePublished 2019-04-10T15:51
    31 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    32 schema:sdPublisher N627870ee41c9420580f540b185e37096
    33 schema:url http://link.springer.com/10.1007%2Fs10623-014-0001-2
    34 sgo:license sg:explorer/license/
    35 sgo:sdDataset articles
    36 rdf:type schema:ScholarlyArticle
    37 N087482d199274399af2f8f475360bd0d schema:name dimensions_id
    38 schema:value pub.1005594259
    39 rdf:type schema:PropertyValue
    40 N28c5d738d23d494ead09ee9de6ce95da schema:name readcube_id
    41 schema:value 1aa762ac8fb7a77d76c701689b4b81968b3099e3fece09160fa23795f92aeb3d
    42 rdf:type schema:PropertyValue
    43 N2a8a257f497c4ba6b52eb7a6f0904a32 rdf:first sg:person.014442111105.21
    44 rdf:rest rdf:nil
    45 N627870ee41c9420580f540b185e37096 schema:name Springer Nature - SN SciGraph project
    46 rdf:type schema:Organization
    47 N878c001c188745588bfd8d191dcd719e schema:name doi
    48 schema:value 10.1007/s10623-014-0001-2
    49 rdf:type schema:PropertyValue
    50 N8ac987ad845e4e589f72dcbcf5d2b83c schema:issueNumber 1
    51 rdf:type schema:PublicationIssue
    52 Nb78beb6a17ea42a8a5c42cf6892a18a9 schema:volumeNumber 77
    53 rdf:type schema:PublicationVolume
    54 Nf600298e78614094aea1bcd24ec4b7a2 rdf:first sg:person.07531500520.10
    55 rdf:rest N2a8a257f497c4ba6b52eb7a6f0904a32
    56 anzsrc-for:09 schema:inDefinedTermSet anzsrc-for:
    57 schema:name Engineering
    58 rdf:type schema:DefinedTerm
    59 anzsrc-for:0914 schema:inDefinedTermSet anzsrc-for:
    60 schema:name Resources Engineering and Extractive Metallurgy
    61 rdf:type schema:DefinedTerm
    62 sg:journal.1136552 schema:issn 0925-1022
    63 1573-7586
    64 schema:name Designs, Codes and Cryptography
    65 rdf:type schema:Periodical
    66 sg:person.014442111105.21 schema:affiliation https://www.grid.ac/institutes/grid.263761.7
    67 schema:familyName Ji
    68 schema:givenName Lijun
    69 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014442111105.21
    70 rdf:type schema:Person
    71 sg:person.07531500520.10 schema:affiliation https://www.grid.ac/institutes/grid.263761.7
    72 schema:familyName Bao
    73 schema:givenName Jingjun
    74 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07531500520.10
    75 rdf:type schema:Person
    76 sg:pub.10.1007/s10623-004-5662-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021975580
    77 https://doi.org/10.1007/s10623-004-5662-9
    78 rdf:type schema:CreativeWork
    79 https://doi.org/10.1002/jcd.20184 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046529445
    80 rdf:type schema:CreativeWork
    81 https://doi.org/10.1016/0012-365x(72)90027-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053342579
    82 rdf:type schema:CreativeWork
    83 https://doi.org/10.1016/0012-365x(92)00055-v schema:sameAs https://app.dimensions.ai/details/publication/pub.1034457549
    84 rdf:type schema:CreativeWork
    85 https://doi.org/10.1016/0097-3165(79)90050-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028008394
    86 rdf:type schema:CreativeWork
    87 https://doi.org/10.1016/0097-3165(82)90001-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022732319
    88 rdf:type schema:CreativeWork
    89 https://doi.org/10.1016/0097-3165(91)90035-f schema:sameAs https://app.dimensions.ai/details/publication/pub.1031873474
    90 rdf:type schema:CreativeWork
    91 https://doi.org/10.1016/j.disc.2011.10.016 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047104119
    92 rdf:type schema:CreativeWork
    93 https://doi.org/10.1109/18.59932 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061100341
    94 rdf:type schema:CreativeWork
    95 https://doi.org/10.4153/cjm-1960-013-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1072264294
    96 rdf:type schema:CreativeWork
    97 https://www.grid.ac/institutes/grid.263761.7 schema:alternateName Soochow University
    98 schema:name Department of Mathematics, Soochow University, 215006, Suzhou, China
    99 rdf:type schema:Organization
     




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


    ...