A New Minimize Matrix Computation Coding Method for Distributed Storage Systems

<div>Matrix encoding operation in CRS codes when <i>n</i> is 5, <i>k</i> is 2, <svg height="6.1673pt" id="M112" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 9.39034 6.1673" width="9.39034pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M689 332C689 394 670 448 646 448C620 448 597 421 597 396C597 386 600 381 608 372C619 359 620 334 620 315C620 150 538 45 454 45C414 45 386 67 386 122C386 138 388 158 394 180L457 426L452 432L377 416L315 156C302 100 259 45 216 45C176 45 148 67 148 122C148 133 152 158 156 180C162 212 173 259 194 332C201 357 206 384 206 405C206 430 198 448 174 448C125 448 66 406 23 342L43 319C84 368 110 383 121 383C126 383 128 382 128 377C128 370 127 359 122 343C99 268 84 204 77 156C74 137 70 111 70 104C70 25 125 -12 180 -12C228 -12 276 12 319 50C338 8 378 -12 418 -12C549 -12 689 166 689 332Z"></path></g></svg> is 3, <i>X</i> is 1, 2, and <i>Y</i> is 0, 3, 4, 5, 6. The number <svg height="6.1673pt" id="M113" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 18.1591 6.1673" width="18.1591pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M445 282C445 390 384 448 297 448C266 448 231 437 189 418C96 376 23 279 23 151C23 65 66 -12 169 -12C233 -12 294 18 337 53C411 113 445 201 445 282ZM355 280C355 161 302 62 243 36C231 31 219 30 207 30C147 30 111 78 111 154C111 302 180 380 220 399C231 404 246 407 264 407C311 407 355 367 355 280Z"></path></g><g transform="matrix(.013,0,0,-0.013,6.084,0)"><path d="M495 86L479 114C446 82 419 66 409 66C401 66 401 72 406 97C420 166 436 231 453 297C489 435 454 448 428 448C406 448 384 439 354 422C305 394 222 327 161 247H159L183 345C200 415 194 448 173 448C143 448 82 410 23 351L38 325C64 349 95 371 105 371C111 371 116 365 109 336L25 -4L31 -12C50 -4 77 3 107 9C119 69 132 122 145 168C197 254 321 381 370 381C387 381 393 374 378 305L329 95C309 17 320 -12 345 -12C372 -12 430 19 495 86Z"></path></g><g transform="matrix(.013,0,0,-0.013,12.61,0)"><path d="M391 364C391 409 353 448 295 448C249 448 198 426 152 393C65 331 23 225 23 139C23 14 96 -12 146 -12C198 -12 280 9 367 101L351 124C300 78 242 48 194 48C129 48 109 107 109 162V191C208 213 391 266 391 364ZM313 350C313 305 268 261 113 223C132 334 187 381 217 398C227 404 244 405 261 405C290 405 313 385 313 350Z"></path></g></svg> is 8 in red circle, so that the number of XOR operations is 7.</div>

Mathematical Problems in Engineering

fig4

Figure 4

Figure 4: A New Minimize Matrix Computation Coding Method for Distributed Storage Systems 