Maximum cellular boolean functions and perfect gray codes

A. J. Goldman, B. Bender
{"title":"Maximum cellular boolean functions and perfect gray codes","authors":"A. J. Goldman, B. Bender","doi":"10.6028/jres.067b.007","DOIUrl":null,"url":null,"abstract":"I. A Boolean function of n variables, considered as a subset of t he discl'cLe uni t n-cube Bn> is called cellular if each of its connected components is a face of Bn. Hammin g'~ determination of optimal binary single-error-detectin g codes is generalized to a characteri zation of all propel' cellular functions with the greatest possible number of clements . II. An analysis is made of a class of Gray codes (H amiltonian circuits on Bn) with certain special propcrti es, e.g., ad mi tting for O:Sd:Sn a parti tion in to 2n d subpaths eac h formin g a d-c1 imensional face of Bn.","PeriodicalId":408709,"journal":{"name":"Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1963-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.6028/jres.067b.007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

I. A Boolean function of n variables, considered as a subset of t he discl'cLe uni t n-cube Bn> is called cellular if each of its connected components is a face of Bn. Hammin g'~ determination of optimal binary single-error-detectin g codes is generalized to a characteri zation of all propel' cellular functions with the greatest possible number of clements . II. An analysis is made of a class of Gray codes (H amiltonian circuits on Bn) with certain special propcrti es, e.g., ad mi tting for O:Sd:Sn a parti tion in to 2n d subpaths eac h formin g a d-c1 imensional face of Bn.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最大的细胞布尔函数和完美的灰色代码
1 .一个有n个变量的布尔函数,如果它的每一个连接的分量都是Bn的一个面,那么它被认为是t的子集。将最优二进制单错误检测码的Hammin确定推广到具有最大可能元数的所有推进元函数的表征。2分析了一类具有某些特殊性质的Gray码(Bn上的H米尔顿电路),例如,对于O:Sd:Sn,每条子路径在Bn的d-c1维面上形成2n - d子路径的划分。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A PSEUDO PRIMAL-DUAL INTEGER PROGRAMMING ALGORITHM. Systems of distinct representatives and linear algebra Remarks on Cut-Sets Partially isometric matrices Matrices of class J2
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1