DeFTAN-II: Efficient Multichannel Speech Enhancement With Subgroup Processing
Abstract
References
Index Terms
- DeFTAN-II: Efficient Multichannel Speech Enhancement With Subgroup Processing
Recommendations
Subgroup perfect codes in Cayley sum graphs
AbstractLet be a graph with vertex set V. If a subset C of V is independent in and every vertex in is adjacent to exactly one vertex in C, then C is called a perfect code of . Let G be a finite group and let S be a square-free normal subset of G. ...
On the subgroup perfect codes in Cayley graphs
AbstractLet be a Cayley graph on a finite group G. A perfect code in is a subset C of G such that every vertex in is adjacent to exactly one vertex in C and vertices of C are not adjacent to each other. In Zhang and Zhou (Eur J Comb 91:...
Subgroup total perfect codes in Cayley sum graphs
AbstractLet be a graph with vertex set V, and let a, b be nonnegative integers. An (a, b)-regular set in is a nonempty proper subset D of V such that every vertex in D has exactly a neighbours in D and every vertex in has exactly b neighbours in D...
Comments
Information & Contributors
Information
Published In
Publisher
IEEE Press
Publication History
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 1Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in