151 citations · 383 across the 24 of their papers we have counts for
7 papers · 1 filter
Families of Optimal Binary Non-MDS Erasure Codes
Danilo Gligoroski, Katina Kralevska
We introduce a definition for \emph{Families of Optimal Binary Non-MDS Erasure Codes} for codes over , and propose an algorithm for finding those families by using…
HashTag Erasure Codes: From Theory to Practice
Katina Kralevska, Danilo Gligoroski, Rune E. Jensen +1
Minimum-Storage Regenerating (MSR) codes have emerged as a viable alternative to Reed-Solomon (RS) codes as they minimize the repair bandwidth while they are still optimal in terms…
General Sub-packetized Access-Optimal Regenerating Codes
Katina Kralevska, Danilo Gligoroski, Harald Øverby
This paper presents a novel construction of access-optimal regenerating codes for an arbitrary sub-packetization level for exact repair of any systematic node. We…
Balanced Locally Repairable Codes
Katina Kralevska, Danilo Gligoroski, Harald Øverby
We introduce a family of balanced locally repairable codes (BLRCs) for arbitrary values of , and . Similar to other locally repairable codes (LRCs), the prese…
Coded Packet Transport for Optical Packet/Burst Switched Networks
Katina Kralevska, Harald Oeverby, Danilo Gligoroski
This paper presents the Coded Packet Transport (CPT) scheme, a novel transport mechanism for Optical Packet/Burst Switched (OPS/OBS) networks. The CPT scheme exploits the combined…
Minimal Header Overhead for Random Linear Network Coding
Danilo Gligoroski, Katina Kralevska, Harald Oeverby
The energy used to transmit a single bit of data between the devices in wireless networks is equal to the energy for performing hundreds of instructions in those devices. Thus the…