<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-EZCX9ELM</identifier><date>2018</date><creator>Gillespie, Neil I.</creator><creator>Hawtin, Daniel R.</creator><relation>documents/doc/E/URN_NBN_SI_doc-EZCX9ELM_001.pdf</relation><relation>documents/doc/E/URN_NBN_SI_doc-EZCX9ELM_001.txt</relation><format format_type="volume">14</format><format format_type="issue">2</format><format format_type="type">article</format><format format_type="extent">str. 345-357</format><identifier identifier_type="COBISSID">18417753</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-EZCX9ELM</identifier><language>eng</language><publisher>Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="slv">grafi</subject><subject language_type_id="slv">grupe</subject><subject language_type_id="slv">grupe avtomorfizmov</subject><subject language_type_id="slv">Hammingov graf</subject><title>Alphabet-almost-simple 2-neighbour-transitive codes</title></Record>