On perfect 2-colorings of the <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>q</mml:mi></mml:math>-ary <mml:math altimg="si2.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>n</mml:mi></mml:math>-cube-Reference-Cited by-同舟云学术

On perfect 2-colorings of the q-ary n-cube

Published:2012-03 Issue:6 Volume:312 Page:1269-1272
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Potapov Vladimir N.

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference11 articles.

1. Bounds on orthogonal arrays and resilient functions;Bierbrauer;Journal of Combinatorial Designs,1995

2. Bounds for unrestricted codes by linear programming;Delsarte;Philips Research Reports,1972

3. Perfect 2-colorings of a hypercube;Fon-Der-Flaass;Siberian Mathematical Journal,2007

4. Perfect 2-colorings of the 12-cube that attain the bounds on correlation immunity;Fon-Der-Flaass;Sibirskie Elektronnye Matematicheskie Izvestiya,2007

5. D.G. Fon-Der-Flaass, A bound of correlation immunity, Siberian Electronic Mathematical Reports, 4, 2007, pp. 133–135.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Completely Regular Codes as Optimal Structures;2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY);2023-10-24

2. Perfect Colorings of the Infinite Square Grid: Coverings and Twin Colors;The Electronic Journal of Combinatorics;2023-04-07

3. On the non-existence of extended 1-perfect codes and MDS codes;Journal of Combinatorial Theory, Series A;2022-07

4. Perfect 2‐colorings of Hamming graphs;Journal of Combinatorial Designs;2021-03-10

5. Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph;Discrete Mathematics;2021-03