Multicomponent codes with maximum code distance (Q2364473)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Multicomponent codes with maximum code distance	scientific article

Statements

scholarly article

0 references

Multicomponent codes with maximum code distance (English)

0 references

Problems of Information Transmission

0 references

publication date

21 July 2017

0 references

Ernst M. Gabidulin

0 references

Nina I. Pilipchuk

0 references

MaRDI profile type

MaRDI publication profile

0 references

The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)

0 references

Coding for Errors and Erasures in Random Network Coding

0 references

A Rank-Metric Approach to Error Control in Random Network Coding

0 references

Comment on ‘An ordering policy for deteriorating items with allowable shortage and permissible delay in payment’ by Jamal, Sarker and Wang

0 references

Algebraic codes for network coding

0 references

Theory of codes with maximum rank distance

0 references

Linear authentication codes: bounds and constructions

0 references

0 references

Partial spreads in finite projective spaces and partial designs

0 references

Partial t-spreads and group constructible \((s,r,\mu)\)-nets

0 references

Blocking sets and partial spreads in finite projective spaces

0 references

Johnson type bounds on constant dimension codes

0 references

full work available at URL

https://doi.org/10.1134/s0032946016030054

0 references

Identifiers

zbMATH Open document ID

0 references

10.1134/S0032946016030054

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2364473

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2364473&oldid=37322931"