For a strongly connected category with pairwise coproducts, we introduce a cosimplicial object, which serves as a sort of resolution for computing higher derived functors of . Applications involve the Knneth theorem for higher limits and -finiteness of -codes. A dictionary for the -codes with words of length is given.

Bibliography: 19 titles.

中文翻译：

---

极限、标准复合体和 - 代码

对于具有成对余积的强连接类别，我们引入了一个共单纯对象，它作为一种分辨率来计算 的更高派生函子。应用程序涉及更高限制和 -码的有限性的 Knneth 定理。给出了具有长度单词的-codes的字典。

参考书目：19 题。