most citedHashTag Erasure Codes: From Theory to Practice

44 citations · 105 across the 6 of their papers we have counts for

collaborators

6 papers

cs.IT2016★ 44 cited

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…

cs.IT2016★ 22 cited

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…

cs.IT2016★ 9 cited

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…

cs.IT2016★ 3 cited

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…

cs.IT2016★ 23 cited

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…

cs.IT2016★ 4 cited

Balanced XOR-ed Coding

Katina Kralevska, Danilo Gligoroski, Harald Oeverby

This paper concerns with the construction of codes over which reach the max-flow for single source multicast acyclic networks with delay. The coding is always a bitwise XOR…