Every binary code can be realized by convex sets

DOI10.1016/J.AAM.2018.04.004MaRDI QIDQ1637597zbMATHOpenAlexFDO

Authors Megan Franke, Samuel Muthiah

Publication date 8 June 2018

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1711.03185

zbMATH Keywords

binary codeconvexHelly's theoremneural code

Mathematics Subject Classification ID

Neural biology (92C20) Simplicial sets and complexes in algebraic topology (55U10) Combinatorial aspects of simplicial complexes (05E45) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Linear codes (general theory) (94B05)

Abstract: Much work has been done to identify which binary codes can be represented by collections of open convex or closed convex sets. While not all binary codes can be realized by such sets, here we prove that every binary code can be realized by convex sets when there is no restriction on whether the sets are all open or closed. We achieve this by constructing a convex realization for an arbitrary code with $k$ nonempty codewords in $mathbb{R}^{k-1}$. This result justifies the usual restriction of the definition of convex neural codes to include only those that can be realized by receptive fields that are all either open convex or closed convex. We also show that the dimension of our construction cannot in general be lowered.

Recommendations

• Planar Convex Codes are Decidable
• Convex union representability and convex codes
• Every binary self-dual code arises from Hilbert symbols
• On a class of abstract polytopes constructed from binary codes
• Every Convolutional Code is a Goppa Code
• Some results on the existence of binary linear codes (Corresp.)
• scientific article; zbMATH DE number 1188976
• Perfect binary codes: bounds and properties
• The nonexistence of certain binary linear codes
• On the convexity of a function in coding theory

Cites work

• Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
• Obstructions to convexity in neural codes
• On open and closed convex codes
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• What makes a neural code convex?

Cited in

(9)

• Minimal embedding dimensions of connected neural codes
• Planar Convex Codes are Decidable
• Non-monotonicity of closed convexity in neural codes
• Signless normalized Laplacian for hypergraphs
• On open and closed convex codes
• Realizing convex codes with axis-parallel boxes
• Embedding dimension phenomena in intersection complete codes
• Neural codes and the factor complex
• Neural codes, decidability, and a new local obstruction to convexity

This page was built for publication: Every binary code can be realized by convex sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1637597)