Some identities on $q\sp {n-m}$ designs with application to minimum aberration designs
q 水平分数因子设计的恒等式及其最小混杂度应用AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要属于因子实验设计与编码理论,未提供所列因果推断等细分领域的方法依据。
反馈分类问题q 水平分数因子设计的恒等式及其最小混杂度应用AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Chen and Hedayat and Tang and Wu studied and characterized minimum aberration $2^{n-m}$ designs in terms of their complemetary designs. Based on a new and more powerful approach, we extend the study to identify minimum aberration $q^{n-m}$ designs through their complementary designs. By using MacWilliams identities and Krawtchouk polynomials in coding theory, we obtain some general and explicit relationships between the wordlength pattern of a $q^{n-m}$ design and that of its complementary design. These identities provide a powerful tool for characterizing minimum aberration $q^{n-m}$ designs. The case of $q = 3$ is studied in more details.