# A Converse Bound on Wyner-Ahlswede-K\"orner Network via Gray-Wyner Network

## TL;DR

This paper introduces a reduction method linking codes for the Gray-Wyner network to those for the Wyner-Ahlswede-K"orner network, providing a new converse bound and an alternative proof of the strong converse theorem.

## Contribution

It presents a novel reduction technique that derives a converse bound for the WAK network from the GW network, offering new insights into network information theory.

## Key findings

- Derived a new converse bound for the WAK network
- Provided an alternative proof for the strong converse theorem
- Established a reduction method connecting GW and WAK networks

## Abstract

We show a reduction method to construct a code for the Gray-Wyner (GW) network from a given code for the Wyner-Ahlswede-K\"orner (WAK) network. By combining this reduction with a converse bound on the GW network, we derive a converse bound on the WAK network. The derived bound gives an alternative proof of the strong converse theorem for the WAK network.