Dieter Jungnickel


Ontology type: schema:Person     


Person Info

NAME

Dieter

SURNAME

Jungnickel

Publications in SciGraph latest 50 shown

  • 2020 Topics in Galois Fields in NONE
  • 2019-04-08 Partitioned difference families versus zero-difference balanced functions in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2018-06-15 The classification of Steiner triple systems on 27 points with 3-rank 24 in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2017-12-21 On Classifying Steiner Triple Systems by Their 3-Rank in MATHEMATICAL ASPECTS OF COMPUTER AND INFORMATION SCIENCES
  • 2017-09-02 On Bonisoli’s theorem and the block codes of Steiner triple systems in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2017-03-01 Extension sets, affine designs, and Hamada’s conjecture in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2016-03-26 Editorial: finite geometries in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2015-11-21 Editorial for the 25th anniversary issue in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2015-10-27 On a theorem of Rigby in JOURNAL OF GEOMETRY
  • 2015-08-20 The characterization problem for designs with the parameters of AGd(n, q) in COMBINATORICA
  • 2015-03-25 Maximal arcs and quasi-symmetric designs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2015 Optimierungsmethoden, Eine Einführung in NONE
  • 2013-08-09 Obituary: Hanfried Lenz (1916–2013) in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2013-02-16 Obituary: Daniel R. Hughes (1927–2012) in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2013-02-16 Obituary: Marialuisa J. de Resmini (1939–2012) in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2013 Graphs, Networks and Algorithms in NONE
  • 2012-12-18 Editorial: Finite geometries in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2012-11-18 The geometric dimension of some small configurations in JOURNAL OF GEOMETRY
  • 2012-09-25 Remarks on polarity designs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2012-02-29 New invariants for incidence structures in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2011-11-11 A Hamada type characterization of the classical geometric designs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2011-08 Recent results on designs with classical parameters in JOURNAL OF GEOMETRY
  • 2009-05-23 The number of designs with geometric parameters grows exponentially in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2008-11-26 Polarities, quasi-symmetric designs, and Hamada’s conjecture in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2008-03-06 The isomorphism problem for abelian projective planes in APPLICABLE ALGEBRA IN ENGINEERING, COMMUNICATION AND COMPUTING
  • 2008-02-15 Finite geometries in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2008 Graphs, Networks and Algorithms in NONE
  • 2007-07-17 Preface in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2007-03 A Non-Existence Result For Finite Projective Planes In Lenz-Barlotti Class I.4 in COMBINATORICA
  • 2003-05 Finite Geometries in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2003-05 Some New Maximal Sets of Mutually Orthogonal Latin Squares in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2002-06 Arcs and Ovals from Abelian Groups in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2001 On a Class of Symmetric Divisible Designs which are Almost Projective Planes in FINITE GEOMETRIES
  • 1999 Optimierungsmethoden, Eine Einführung in NONE
  • 1999 Graphs, Networks and Algorithms in NONE
  • 1999 Difference Sets: An Introduction in DIFFERENCE SETS, SEQUENCES AND THEIR CORRELATION PROPERTIES
  • 1996-05 Codes Based on Complete Graphs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1996-05 Codes based on complete graphs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1996-05 A Life's Work in Geometry: An Homage to Hanfried Lenz in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1996 Codes Based on Complete Graphs in DESIGNS AND FINITE GEOMETRIES
  • 1996 A Life’s Work in Geometry: An Homage to Hanfried Lenz in DESIGNS AND FINITE GEOMETRIES
  • 1995-11 An application of coding theory to a problem in graphical enumeration in ARCHIV DER MATHEMATIK
  • 1994-07 A new class of symmetric (v, k, λ)-designs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1994-06 Erratum in GRAPHS AND COMBINATORICS
  • 1994-02 A note on orthogonal circulant matrices over finite fields in ARCHIV DER MATHEMATIK
  • 1992-09 Strongly Regular Semi-Cayley Graphs in JOURNAL OF ALGEBRAIC COMBINATORICS
  • 1992-08 On the number of isomorphism classes of complete translation nets in ARCHIV DER MATHEMATIK
  • 1991-09 Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1991-09 The mann test for divisible difference sets in GRAPHS AND COMBINATORICS
  • 1991-03 The existence of non-trivial hyperfactorizations ofK2n in COMBINATORICA
  • 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", 
        "affiliation": [
          {
            "affiliation": {
              "id": "http://www.grid.ac/institutes/grid.7307.3", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.5330.5", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.5406.7", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.46078.3d", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.8664.c", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.6734.6", 
            "type": "Organization"
          }
        ], 
        "familyName": "Jungnickel", 
        "givenName": "Dieter", 
        "id": "sg:person.016273474670.91", 
        "identifier": [
          {
            "name": "orcid_id", 
            "type": "PropertyValue", 
            "value": "0000-0001-5615-6934"
          }
        ], 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016273474670.91", 
          "https://orcid.org/0000-0001-5615-6934"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-11-24T21:36", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20221124/entities/gbq_results/person/person_656.jsonl", 
        "type": "Person"
      }
    ]
     

    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/person.016273474670.91'

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

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.016273474670.91'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.016273474670.91'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.016273474670.91'


     

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

    31 TRIPLES      11 PREDICATES      18 URIs      8 LITERALS      3 BLANK NODES

    Subject Predicate Object
    1 sg:person.016273474670.91 schema:affiliation Nd758af1507bc498ea173dff70f91dab5
    2 grid-institutes:grid.46078.3d
    3 grid-institutes:grid.5330.5
    4 grid-institutes:grid.5406.7
    5 grid-institutes:grid.6734.6
    6 grid-institutes:grid.8664.c
    7 schema:familyName Jungnickel
    8 schema:givenName Dieter
    9 schema:identifier Nb7a9c210c587462395b1860285df9770
    10 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016273474670.91
    11 https://orcid.org/0000-0001-5615-6934
    12 schema:sdDatePublished 2022-11-24T21:36
    13 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    14 schema:sdPublisher Nd10ce563ab77452b8dcf5b92722092f5
    15 sgo:license sg:explorer/license/
    16 sgo:sdDataset persons
    17 rdf:type schema:Person
    18 Nb7a9c210c587462395b1860285df9770 schema:name orcid_id
    19 schema:value 0000-0001-5615-6934
    20 rdf:type schema:PropertyValue
    21 Nd10ce563ab77452b8dcf5b92722092f5 schema:name Springer Nature - SN SciGraph project
    22 rdf:type schema:Organization
    23 Nd758af1507bc498ea173dff70f91dab5 schema:affiliation grid-institutes:grid.7307.3
    24 sgo:isCurrent true
    25 rdf:type schema:OrganizationRole
    26 grid-institutes:grid.46078.3d schema:Organization
    27 grid-institutes:grid.5330.5 schema:Organization
    28 grid-institutes:grid.5406.7 schema:Organization
    29 grid-institutes:grid.6734.6 schema:Organization
    30 grid-institutes:grid.7307.3 schema:Organization
    31 grid-institutes:grid.8664.c schema:Organization
     




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


    ...